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.
04 / Dynamic Programming
Unbounded Knapsack
Reuse item types without limit. See why taking keeps the same index and how memoization avoids repeated calls.
05 / Sorting & Binary Search
Russian Doll Envelopes
Sort widths with a crucial height tie-break, then watch a height LIS reveal the longest nesting.
06 / Dynamic Programming
Largest Divisible Subset
Sort the numbers, grow the best divisible chain at each value, and follow parent links back to an answer.
07 / Dynamic Programming
Print Longest Common Subsequence
Choose matching letters in order and trace a memoized recursion that prints one longest answer.
08 / Dynamic Programming
Shortest Common Supersequence
Merge two strings in the shortest possible way by watching recursive choices and memo hits.
09 / Dynamic Programming
Count A as a Subsequence in B
Count distinct choices of B’s indices that spell A, using recursive use-or-skip decisions.
10 / Dynamic Programming
Regular Expression Matching
See why * changes the base case, then trace skip-or-consume recursion with memoization.
No problems found
Try another keyword or change your filters.