010 of 28 solved
Data Structures
Pick the structure that keeps only what still matters.
Stack6 problems
Last in, first out: the newest item is the first to leave.
Queue & Deque4 problems
First in, first out; a deque opens both ends.
Heap5 problems
Always hands you the smallest (or largest) item.
Set & Multiset4 problems
A sorted collection with fast search, insert and erase.
Map & Hashing4 problems
Look things up by key instead of by position.
Prefix Sums & Bitset5 problems
Precompute running totals to answer range sums in O(1).