Class 1Data Structures I — Arrays & Strings
- How memory and arrays actually work
- Traversal, insertion, deletion
- String operations & common tricks
- Problems: Reverse, prefix sums, palindrome check
Class 2Data Structures II — Linked Lists, Stacks & Queues
- Singly & doubly linked lists
- Stacks and queues (and when to use them)
- Implementation from scratch
- Problems: Reverse a list, valid parentheses
Class 3Data Structures III — Hashing & Trees
- Hash maps and hash sets
- Binary trees & binary search trees
- Tree traversals (DFS/BFS)
- Problems: Two-sum, tree height, lookups
Class 4Data Structures IV — Heaps & Graph Basics
- Heaps / priority queues
- Graph representation
- BFS and DFS on graphs
- Problems: Top-K elements, shortest path (unweighted)
Class 5Algorithms I — Searching, Sorting & Complexity
- Big-O in plain language
- Binary search and its variants
- Sorting algorithms and trade-offs
- Problems: Search in rotated array
Class 6Algorithms II — Recursion, Two Pointers & Sliding Window