Lesson IDs are Phase.Chapter.Topic, for example 6.3.1 is Phase 6, Chapter 6.3, Topic 1. The order is a prerequisite chain. ✅ marks what you have marked as done.
🧭 PHASE 0 — FOUNDATIONS
- Ch 0.1 What an algorithm is
- 0.1.1 Problems, instances and algorithms; correctness; counting basic steps
- 0.1.2 Math toolkit: logarithms, floors and ceilings, sums (arithmetic, geometric, harmonic)
- LI-0.1 Chapter 0.1 Lock-in Lock-in
- Ch 0.2 Data-structure recap
- 0.2.1 Arrays, linked lists, stacks and queues: what each operation costs
- 0.2.2 Trees, binary search trees and binary heaps: heights and operation costs
- 0.2.3 Graphs: vocabulary, adjacency matrix vs adjacency list
- LI-0.2 Chapter 0.2 Lock-in Lock-in
- CP-0 Phase 0 Checkpoint (15 questions) Checkpoint
📈 PHASE 1 — ASYMPTOTIC ANALYSIS & RECURRENCES
- Ch 1.1 Growth of functions
- 1.1.1 Big-O, Big-Ω and Θ: definitions with constants GATE favourite
- 1.1.2 Little-o and little-ω; comparing and ordering functions GATE favourite
- 1.1.3 Analysing loops: nested, dependent and logarithmic loops GATE favourite
- LI-1.1 Chapter 1.1 Lock-in Lock-in
- Ch 1.2 Recurrences
- 1.2.1 Recurrences from recursive code; solving by unrolling (substitution) GATE favourite
- 1.2.2 The recursion-tree method GATE favourite
- 1.2.3 The master theorem GATE favourite
- 1.2.4 Harder recurrences: change of variables, T(n−1) forms, unequal splits
- Ch 1.3 Cases and space
- 1.3.1 Best, worst and average case; space complexity and recursion depth; amortised cost
- LI-1.2-1.3 Chapters 1.2–1.3 Lock-in Lock-in
- CP-1 Phase 1 Checkpoint (15 questions) Checkpoint
🔍 PHASE 2 — SEARCHING & HASHING
- Ch 2.1 Searching
- 2.1.1 Linear search and binary search: comparisons and correctness GATE favourite
- 2.1.2 Binary search variants and the Ω(log n) lower bound for searching
- LI-2.1 Chapter 2.1 Lock-in Lock-in
- Ch 2.2 Hashing
- 2.2.1 Hash tables, hash functions, load factor; separate chaining GATE favourite
- 2.2.2 Open addressing: linear probing, quadratic probing, double hashing GATE favourite
- 2.2.3 Expected probes and collision probabilities
- LI-2.2 Chapter 2.2 Lock-in Lock-in
- CP-2 Phase 2 Checkpoint (15 questions) Checkpoint
🔢 PHASE 3 — SORTING
- Ch 3.1 Elementary sorts
- 3.1.1 Bubble sort and selection sort: passes, comparisons, swaps
- 3.1.2 Insertion sort and inversions; stable and in-place sorting GATE favourite
- LI-3.1 Chapter 3.1 Lock-in Lock-in
- Ch 3.2 Divide-and-conquer sorts
- 3.2.1 Merge sort: merging, recurrence, comparison counts GATE favourite
- 3.2.2 Quicksort: partitioning, best, worst and average cases GATE favourite
- 3.2.3 Heapsort: build-heap in O(n), heapify, extract-max GATE favourite
- LI-3.2 Chapter 3.2 Lock-in Lock-in
- Ch 3.3 Beyond comparison sorting
- 3.3.1 The Ω(n log n) lower bound for comparison sorting; comparing all sorts
- 3.3.2 Counting sort, radix sort and bucket sort
- 3.3.3 Selection: minimum and maximum, second largest, k-th smallest
- LI-3.3 Chapter 3.3 Lock-in Lock-in
- CP-3 Phase 3 Checkpoint (15 questions) Checkpoint
✂️ PHASE 4 — DIVIDE & CONQUER AND GREEDY
- Ch 4.1 Divide and conquer
- 4.1.1 Divide and conquer: fast exponentiation, counting inversions, maximum subarray
- 4.1.2 Karatsuba and Strassen multiplication; closest pair (brief)
- LI-4.1 Chapter 4.1 Lock-in Lock-in
- Ch 4.2 Greedy algorithms
- 4.2.1 The greedy method; activity selection GATE favourite
- 4.2.2 Fractional knapsack; job sequencing with deadlines GATE favourite
- 4.2.3 Huffman coding GATE favourite
- 4.2.4 Optimal merge pattern; when greedy fails
- LI-4.2 Chapter 4.2 Lock-in Lock-in
- CP-4 Phase 4 Checkpoint (15 questions) Checkpoint
🧩 PHASE 5 — DYNAMIC PROGRAMMING
- Ch 5.1 DP foundations
- 5.1.1 Overlapping subproblems: memoisation vs tabulation; counting calls GATE favourite
- 5.1.2 0/1 knapsack GATE favourite
- 5.1.3 Longest common subsequence GATE favourite
- LI-5.1 Chapter 5.1 Lock-in Lock-in
- Ch 5.2 More DP problems
- 5.2.1 Matrix-chain multiplication GATE favourite
- 5.2.2 Subset sum, coin change and rod cutting
- 5.2.3 Longest increasing subsequence, edit distance and other sequence DPs
- LI-5.2 Chapter 5.2 Lock-in Lock-in
- CP-5 Phase 5 Checkpoint (15 questions) Checkpoint
🕸️ PHASE 6 — GRAPH ALGORITHMS
- Ch 6.1 Graph traversals
- 6.1.1 Breadth-first search: levels and unweighted shortest paths GATE favourite
- 6.1.2 Depth-first search: discovery and finish times, edge classification GATE favourite
- 6.1.3 Topological sort, cycle detection, connected and strongly connected components
- LI-6.1 Chapter 6.1 Lock-in Lock-in
- Ch 6.2 Minimum spanning trees
- 6.2.1 Minimum spanning trees: cut and cycle properties, uniqueness GATE favourite
- 6.2.2 Kruskal's algorithm and union–find GATE favourite
- 6.2.3 Prim's algorithm; MST complexities GATE favourite
- LI-6.2 Chapter 6.2 Lock-in Lock-in
- Ch 6.3 Shortest paths
- 6.3.1 Relaxation and Dijkstra's algorithm GATE favourite
- 6.3.2 Bellman–Ford, negative cycles, shortest paths in DAGs GATE favourite
- 6.3.3 All-pairs shortest paths: Floyd–Warshall GATE favourite
- LI-6.3 Chapter 6.3 Lock-in Lock-in
- CP-6 Phase 6 Checkpoint (15 questions) Checkpoint
🏁 PHASE 7 — INTEGRATION & FINAL TEST
- Ch 7.1 Master rule sheet
- 7.1.1 Master Rule Sheet (all rule cards merged) Revision
- Ch 7.2 Mixed practice
- 7.2.1 Mixed practice set 1 Revision
- 7.2.2 Mixed practice set 2 Revision
- 7.2.3 Mixed practice set 3 Revision
- Ch 7.3 GATE pattern drill
- 7.3.1 GATE pattern drill: recurring patterns and fastest methods Revision
- Ch 7.4 Final test
- 7.4.1 Final end-to-end test (30 questions, 90 min) Final test
Phases
🧭
Phase 0 · Foundations
5 lessons · 2 lock-ins · checkpoint
📈
Phase 1 · Asymptotic Analysis & Recurrences
8 lessons · 2 lock-ins · checkpoint
🔍
Phase 2 · Searching & Hashing
5 lessons · 2 lock-ins · checkpoint
🔢
Phase 3 · Sorting
8 lessons · 3 lock-ins · checkpoint
✂️
Phase 4 · Divide & Conquer and Greedy
6 lessons · 2 lock-ins · checkpoint
🧩
Phase 5 · Dynamic Programming
6 lessons · 2 lock-ins · checkpoint
🕸️
Phase 6 · Graph Algorithms
9 lessons · 3 lock-ins · checkpoint
🏁
Phase 7 · Integration & Final Test
rule sheet · 3 practice sets · drill · final test