Phase 2 · weeks 15-24 · 10 weeks
Data Structures & Algorithms
- Time/space complexity, Big-O
- Arrays, strings, searching (linear/binary)
- Sorting (bubble, insertion, merge, quick, heap)
- Linked lists (singly, doubly, circular)
- Stacks, queues, deque, priority queue
- Recursion & backtracking
- Trees: binary trees, BST, tries, heaps
- Hashing & hash tables
- Graphs: BFS, DFS, Dijkstra, topological sort, Union-Find
- Dynamic Programming: memoization, tabulation, classic problems
- Greedy algorithms, divide and conquer
- System design intro: scalability, complexity trade-offs
Project: Pathfinding visualizer / mini search engine using tries