Work through the topics in order. Each one has a short explanation, key patterns and problems from easy to hard, with solutions in five languages.
Count the work your code does, and think recursively.
48 problems · 17 easy · 19 medium · 12 hard
GCD, primes and modular thinking.
49 problems · 16 easy · 21 medium · 12 hard
Scan, compare and rebuild text efficiently.
47 problems · 15 easy · 20 medium · 12 hard
Indexing, in-place updates and prefix tricks.
48 problems · 15 easy · 21 medium · 12 hard
Trade memory for O(1) lookups.
47 problems · 15 easy · 20 medium · 12 hard
Walk two indices to avoid nested loops.
48 problems · 15 easy · 20 medium · 13 hard
Maintain a moving range instead of recomputing it.
48 problems · 15 easy · 22 medium · 11 hard
Last in, first out: matching and monotonic patterns.
45 problems · 16 easy · 19 medium · 10 hard
First in, first out, plus double-ended windows.
45 problems · 15 easy · 19 medium · 11 hard
Pointer manipulation and fast/slow pointers.
45 problems · 15 easy · 19 medium · 11 hard
Halve the search space on monotonic conditions.
45 problems · 15 easy · 19 medium · 11 hard
Comparison sorts, counting and custom orders.
45 problems · 15 easy · 19 medium · 11 hard
Recursive traversal of hierarchical data.
49 problems · 16 easy · 19 medium · 14 hard
Priority queues for top-k and scheduling.
50 problems · 14 easy · 21 medium · 15 hard
BFS, DFS and shortest paths.
45 problems · 15 easy · 20 medium · 10 hard
Local choices that are provably globally optimal.
45 problems · 14 easy · 19 medium · 12 hard
Explore choices, undo, repeat.
48 problems · 15 easy · 21 medium · 12 hard
Overlapping subproblems and optimal substructure.
47 problems · 15 easy · 20 medium · 12 hard
Prefix trees for fast string lookups.
47 problems · 15 easy · 20 medium · 12 hard
Operate on binary representations.
49 problems · 16 easy · 20 medium · 13 hard