Module 1
Data structures: the building blocks of efficient algorithms
- Arrays and strings, including in-place manipulation and two pointer work
- HashMaps and hash sets for counting, deduplication and constant-time lookups
- Linked lists: traversal, reversal and cycle detection
- Trees and the traversals every interview assumes you know
- Graphs: representation, breadth-first and depth-first search
- Heaps and priority queues for top-k and streaming problems
By the end: You reach for the right container on sight instead of forcing every problem through a nested loop.
