Complexity & Big-O
How to measure how fast and how memory-heavy a solution is — the language used to compare approaches and the first thing interviews expect.
Arrays & Strings
The most common data structures, core operations, and the patterns (two pointers, sliding window) that solve a huge share of problems.
Linked Lists, Stacks & Queues
Linear structures, how they differ from arrays, and the classic problems built on them.
Recursion & Searching
Thinking recursively, binary search, and divide-and-conquer approaches.
Sorting Algorithms
Common sorting techniques, how they work, and when each one is the right choice.
Trees & Graphs
Hierarchical and connected structures — traversals, and the problems that appear constantly in interviews.
Hashing & Problem Patterns
Hash maps/sets and the recurring patterns that turn "hard" problems into familiar ones.
Interview Practice
Applying everything to real interview-style problems, explaining your thinking, and building speed and confidence.
You finish able to: Break down a problem, pick the right data structure, and write an efficient, interview-ready solution.