The Standard Template Library (STL) is a library for the C++ programming language. The STL provides many useful algorithms and containers. The Containers are objects that store data. We have taken help of following containers to solve mentioned problems –

vector, list, queue, priority_queue, stack, set, map, multimap, unordered_set, unordered_multiset, unordered_map, unordered_multimap

We have avoided using STL algorithms as main purpose of these problems are to improve your coding skills and using in-built algorithms will do no good.. Nevertheless, we have still used following common algorithms at many places –

**min, max, swap, sort, next_permutation, binary_search, rotate, reverse**

#### Heap (Priority Queue) –

#### Graphs –

#### Array –

#### Matrix –

#### Strings –

#### Binary Tree –

#### Dynamic Programming –

#### Miscellaneous –

**Thank you for being with us. 🙂**

## Leave a Reply

I’ve spent the last hour browsing and I would like to say this is a great resource for coding problems. I like that the methodology for solving them is discussed for each posting.

amazing work!