STL · CS Fundamentals
STL in C++ for Interviews
The STL you actually need for interviews is small: vector, unordered_map/unordered_set, priority_queue, and the <algorithm> functions built on iterators (sort, lower_bound, next_permutation). Interviewers care whether you reach for the right container under time pressure during a live coding problem, not whether you can recite the full STL API.
The STL that actually shows up in interviews
- vector — dynamic arrays, the default container for almost everything
- unordered_map / unordered_set — O(1) average lookup, the backbone of most "have I seen this before" problems
- priority_queue — heaps, without hand-rolling one
- <algorithm>: sort, lower_bound/upper_bound (binary search on sorted ranges), next_permutation
- pair and tuple for lightweight multi-value returns
How to actually practice this on Ediky
Rather than memorizing STL signatures in isolation, use them under real problem pressure: Ediky's 70-problem DSA bank has a full in-browser C++ IDE, and picking `unordered_map` over a nested loop, or `lower_bound` over a manual binary search, is exactly the STL fluency interviewers are actually testing for.
Practice STL in real problems
Use STL containers and algorithms live in Ediky's 70-problem DSA bank with a full in-browser C++ IDE.
Open the DSA problem bank