Roadmap/Dynamic Programming

9 subtopics · 47 problems

Dynamic Programming

Work through 9 subtopics covering 47 problems, ordered from foundational to advanced.

47Total problems

0Solved

0Attempted

0%Completion

Introduction to Dynamic Programming (Learn)

Dynamic Programming

Easy

15m

Climbing Stairs

Dynamic Programming · Recursion

Easy

15m

Frog Jump I

Dynamic Programming · Recursion

Easy

20m

Frog Jump II

Dynamic Programming · Recursion

Medium

25m

House Robber I

Dynamic Programming · Arrays

Medium

20m

House Robber II

Dynamic Programming · Arrays

Medium

25m

Triathlon Training

Dynamic Programming · Arrays

Medium

30m

Unique Paths I

Dynamic Programming · Arrays

Medium

20m

Unique Paths II

Dynamic Programming · Arrays

Medium

25m

Minimum Path Sum

Dynamic Programming · Arrays

Medium

25m

Triangle

Dynamic Programming · Arrays

Medium

25m

Maximum Path Sum

Dynamic Programming · Arrays

Medium

25m

Samurai & His Friends

Dynamic Programming · Arrays

Medium

30m

Subset Sum

Dynamic Programming · Arrays · Recursion

Medium

25m

Partition Equal Subset Sum

Dynamic Programming · Arrays

Medium

25m

Partition with Minimum Difference

Dynamic Programming · Arrays

Medium

25m

Counting Subsets with Target Sum

Dynamic Programming · Arrays

Medium

25m

Count Partitions with Given Difference

Dynamic Programming · Arrays

Medium

25m

Possible Coin Combinations

Dynamic Programming · Arrays

Medium

25m

Target Expression Count

Dynamic Programming · Recursion

Medium

25m

Unbounded Knapsack

Dynamic Programming · Arrays

Medium

25m

Maximize Profit from Wood Planks

Dynamic Programming · Arrays

Medium

25m

Longest Common Subsequence

+1

Dynamic Programming · Strings

Medium

25m

Print the Longest Common Subsequence

Dynamic Programming · Strings

Medium

25m

Longest Common Substring

Dynamic Programming · Strings

Medium

25m

Longest Palindromic Subsequence

Dynamic Programming · Strings

Medium

25m

Minimum Insertions to Make Palindrome

Dynamic Programming · Strings

Hard

30m

Minimum Deletions to Make Strings Equal

Dynamic Programming · Strings

Medium

25m

Shortest Common Supersequence

Dynamic Programming · Strings

Hard

30m

Counting Subsequences

Dynamic Programming · Strings

Hard

30m

Edit Distance

+1

Dynamic Programming · Strings

Hard

35m

WildCard Matching

Dynamic Programming · Strings

Hard

35m

Stock Trading II

Dynamic Programming · Greedy · Arrays

Medium

20m

Stock Trading III

Dynamic Programming · Arrays

Hard

30m

Stock Trading IV

Dynamic Programming · Arrays

Hard

30m

Buy and Sell Products with Transaction Fee

Dynamic Programming · Greedy · Arrays

Medium

25m

Building a Growing Sequence of Heights

Dynamic Programming · Arrays · Binary Search

Medium

25m

Print the Longest Increasing Subsequence

Dynamic Programming · Arrays

Medium

25m

Find the Largest Divisible Chain

Dynamic Programming · Arrays · Sorting

Medium

25m

Expanding the Longest Word Sequence

Dynamic Programming · Strings · Sorting

Hard

30m

Longest Mountain Subsequence

Dynamic Programming · Arrays

Hard

30m

Longest Increasing Subsequence Count

Dynamic Programming · Arrays

Hard

30m

Minimum Matrix Multiplication Cost

Dynamic Programming · Recursion

Hard

40m

Minimum Cost to Divide a Rod

Dynamic Programming · Recursion

Hard

35m

Maximum Coins from Bursting Bubbles

Dynamic Programming · Recursion

Hard

40m

Minimum Divisions

Dynamic Programming · Recursion

Hard

35m

Maximal Unity Rectangle Discovery

Dynamic Programming · Stack · Monotonic Stack

Hard

40m