C++ STL Containers

#include <vector> # include vector
vector<int> v; # create empty vector
v.push_back(10); # add element at end
v.pop_back(); # remove last element
v[0] # access element
v.size() # get size
v.empty() # check if empty

#include <map> # include map
map<string, int> m; # create map
m["age"] = 25; # insert key-value pair
m.insert({"score", 100}); # insert pair
m.erase("age"); # remove key
m.find("age") != m.end() # check if key exists

#include <set> # include set
set<int> s; # create set
s.insert(10); # add element (unique)
s.erase(10); # remove element
s.count(10) # check if exists (0 or 1)
s.size() # number of elements

#include <stack> # include stack
stack<int> st; # create stack (LIFO)
st.push(10); # add to top
st.pop(); # remove from top
st.top() # access top element
st.empty() # check if empty

#include <queue> # include queue
queue<int> q; # create queue (FIFO)
q.push(10); # add to back
q.pop(); # remove from front
q.front() # access front element
q.back() # access back element