mediumClassic DP Problems
QuizMaximize total value under capacity constraint by deciding whether to include each item.
Open Workstation
Break down complex problems into overlapping subproblems with memoization and tabulation. Choose an algorithm below to launch its interactive simulation workstation.
Showing 6 of 6 algorithms
Maximize total value under capacity constraint by deciding whether to include each item.
Count distinct ways to reach the top taking 1 or 2 steps at a time.
Compute minimum number of coins needed to make up a given amount.
Compute Fibonacci numbers in linear time using bottom-up tabulation.
Find length of the longest subsequence present in both sequences.
Find length of the longest strictly increasing subsequence in an array.