STL Library

List: Lists are sequence containers that allow non-contiguous memory allocation. As compared to vector, list has slow traversal, but once a position has been found, insertion and deletion are quick.

Pair: The pair container is a simple container defined in <utility> header consisting of two data elements or objects

Deque: Double ended queues are sequence containers with the feature of expansion and contraction on both the ends.

Set: a type of associative containers in which each element has to be unique

Multiset: Multisets are a type of associative containers similar to set, with an exception that multiple elements can have same values

Map: a type of associative containers that store elements with keys and mapped value. Each key value has to be unique.

Multimap: Multimap is similar to map with an addition that multiple elements can have same keys.

Queue: Queues are a type of container adaptors which operate in a first in first out (FIFO) type of arrangement


Priority Queue: Priority queues are a type of container adapters, specifically designed such that the first element of the queue is the greatest of all elements in the queue and elements are in non decreasing order

TODO:
https://www.geeksforgeeks.org/numeric-library-c-stl/
https://www.geeksforgeeks.org/iterator-library-c-stl/
https://www.geeksforgeeks.org/binary-search-algorithms-the-c-standard-template-library-stl/
https://www.geeksforgeeks.org/c-magicians-stl-algorithms/
https://www.geeksforgeeks.org/useful-array-algorithms-in-c-stl/
https://www.geeksforgeeks.org/stdpartition-in-c-stl/
https://www.tutorialspoint.com/cplusplus/cpp_stl_tutorial.htm