1. Containers a. Vector push_back(value) pop_back() size() clear() at(index) front() back() empty() insert(position, value) erase(position) begin() end()

b. Stack push(value) pop() top() empty() size()

c. Queue push(value) pop() front() back() empty() size()

d. Deque push_front(value) push_back(value) pop_front() pop_back() front() back() size() empty()

e. Set insert(value) erase(value) find(value) size() empty() count(value) lower_bound(value) upper_bound(value)

f. Map insert({key, value}) erase(key) find(key) size() empty() at(key) lower_bound(key) upper_bound(key)

g. Unordered Set insert(value) erase(value) find(value) count(value)

h. Unordered Map insert({key, value}) erase(key) find(key) at(key) count(key)

2. Algorithms a. Sorting sort(begin, end) reverse(begin, end) partial_sort(begin, middle, end) stable_sort(begin, end)

b. Searching binary_search(begin, end, value) lower_bound(begin, end, value) upper_bound(begin, end, value) find(begin, end, value)

c. Min/Max min(a, b) max(a, b) min_element(begin, end) max_element(begin, end)

d. Accumulate accumulate(begin, end, init) partial_sum(begin, end, result)

e. Other Algorithms next_permutation(begin, end) prev_permutation(begin, end) rotate(begin, middle, end)

3. Other Functions a. Iterators begin() end() rbegin() rend()

b. Pair make_pair(a, b) first second

4. Utility Functions swap(a, b) fill(begin, end, value) copy(begin, end, output_begin) remove(begin, end, value) remove_if(begin, end, condition)