Lessons
Recursion
Solve problems by having a function call itself on smaller inputs.
11 min
Fibonacci & memoization
Turn painfully slow recursion into instant answers by caching results.
10 min
Linear vs binary search
Find items one by one, or halve the search space every step.
10 min
Sorting algorithms
Build bubble, insertion and merge sort, and see how they differ.
12 min
Big-O intuition
Predict how an algorithm slows down as data grows, by counting steps.
10 min
Classic problems
Two-sum, palindromes, anagrams, stacks and queues: patterns worth knowing.
12 min
Next module
Mini Projects