01 / Dynamic Programming
Maximum Subarray
Find the largest sum of a contiguous slice. See how a recursive choice becomes a fast, elegant solution.
Your visual problem library
Algorithms make more sense when you see them.
Explore interactive walkthroughs, find the idea behind each solution, and keep track of what you’ve finished.
Explore problems0Total problems
0Completed
0%Your progress
The collection
Explore problems
Pick a topic and learn at your own pace.
Check off problems as you finish
Open visualizer ↗
02 / Dynamic Programming
Longest Increasing Subsequence
Choose values in order to make the longest rising sequence, then watch the tails array evolve step by step.
03 / Dynamic Programming
0/1 Knapsack
Choose each item once or skip it. Watch recursive branches and memoized answers find the best value within a weight limit.
No problems found
Try another keyword or change your filters.