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/6
Module 2: Stateful Scans
Use monotonic and window state under pressure.
0/5
Module 3: Combinatorial Search
Explore choice trees and prune invalid branches.
0/10
1
Subsets
medium
Not started
2
Permutations
medium
Not started
3
Combination Sum
medium
Not started
4
Palindrome Partitioning
medium
Not started
5
Word Search
medium
Not started
6
Word Search II
hard
Not started
7
Letter Combinations of a Phone Number
medium
Not started
8
Number of Islands
medium
Not started
9
Word Ladder
hard
Not started
10
N-Queens
hard
Not started
