Practice Problems

Daily Challenge: Paths Around the Walls (1500) Solve it to start a streak

dp Problems

87 practice problems tagged dp , from difficulty 1100 to 2300 — solve them in our in-browser judge with instant verdicts. Browse all problems.

Related: games strings interval-dp matrix-exponentiation binary-search trees graphs combinatorics bitmask greedy

ProblemTopics Solvers Acceptance Difficulty
Fibonacci Number math dp 2
33%
1100
Climbing the Staircase dp 0 1100
Frog Hops dp 0
0%
1200
One Perfect Trade dp greedy 0 1200
Maximum Subarray Sum dp 0 1300
Minimum Subarray Sum dp 0 1300
Non-Adjacent Loot dp 0
0%
1300
Cheapest Path Through the Grid dp 0 1400
Down the Triangle dp 0 1400
The N-th Ugly Number math dp 0 1400
Counting Dice Rolls dp combinatorics 0 1400
Longest Zigzag Subsequence dp greedy 0 1500
Fewest Coins dp 0 1500
Counting Coin Combinations dp 1
33%
1500
Decode the Message strings dp 1
100%
1500
Exact Subset Sum dp 1
100%
1500
Paths Around the Walls dp 0 1500
Counting Routes in a DAG dp graphs 0 1500
Strings Without Adjacent Ones dp matrix-exponentiation 0 1500
Maximum Product Subarray dp 0 1500
Maximum Sum Increasing Subsequence dp 0 1500
Loot on a Ring Road dp 0 1600
Longest Increasing Subsequence dp binary-search 0 1600
Two Equal Piles dp 1
100%
1600
The 0/1 Knapsack dp 1
100%
1600
Unlimited Supplies dp 0 1600
Delete and Earn dp 0 1600
Longest Common Subsequence strings dp 0 1600
Largest All-Ones Square dp 0 1600
Longest Common Substring strings dp 0 1600
The Mountain Subsequence dp 0 1600
Trim to Non-Decreasing dp binary-search 0 1600
The Fairest Cut dp 0 1600
Kadane, Minus One dp 0 1600
Longest Path in a DAG dp graphs 0 1600
Longest Non-Decreasing Subsequence dp binary-search 0 1600
Counting Subsets with Given Sum dp knapsack 0 1600
Maximum Circular Subarray dp 0 1700
Edit Distance strings dp 0 1700
Longest Palindromic Subsequence strings dp 0 1700
Shuffled Together strings dp 0 1700
How Many Longest Increasing dp 0 1700
No Two Neighbours Chosen dp trees 0 1700
Sentence Reconstructions strings dp 0 1700
Minimum Insertions to Palindrome strings dp interval-dp 0 1700
Counting Embeddings strings dp 0 1800
Subtraction Game Oracle dp games 0 1800
Longest Arithmetic Subsequence dp 0 1800
Coins of 1, 3 and 4 dp 0 1800
Ways to Partition a Set dp combinatorics 0 1800