Labels match the textbook's own chapter numbers (Grokking Algorithms,
2nd Edition). Interview-style algorithm thinking, still taught through
interactive quizzes and runnable Python.
🚗
📖 Intro
About Grokking Algorithms
🪂
Chapter 1
Binary Search
📦
Chapter 2
Selection Sort
🪆
Chapter 3
Recursion
⚡
Chapter 4
Quicksort & D&C
🔑
Chapter 5
Hash Tables
🛣️
Chapter 6
Breadth-First Search
🌲
Chapter 7
Trees
🌳
Chapter 8
Balanced Trees
🧭
Chapter 9
Dijkstra's Algorithm
🍰
Chapter 10
Greedy Algorithms
🎒
Chapter 11
Dynamic Programming
🛸
Chapter 12
K-Nearest Neighbors
🏆
Final Trial NEW
Ch. 1–12 Capstone