Advanced Algorithms
← All learning paths
Harder binary-search, greedy, monotonic, backtracking, and optimization problems.
Outcome: Handle unfamiliar hard problems by composing proven patterns.
Recommended first: Arrays & Strings, Dynamic Programming
Module 1: Search & Greedy Proofs
Shrink search spaces and justify local decisions.
0/3
Module 2: Stateful Scans
Use monotonic and window state under pressure.
0/4
Module 3: Combinatorial Search
Explore choice trees and prune invalid branches.
0/6
