Back to Dynamic Programming

Dynamic Programming practice problems

A focused problem list tied to the real-world applications on this topic. Open any problem directly on its platform.

4 problems List view Mobile optimized

Why this page exists

The main topic page explains where the idea is used in production. This child page is only for practice.

Dynamic Programming practice

4 items
1

House Robber

Small-state DP where each choice affects the next allowable step.

LeetCode
2

Coin Change

A common minimum-cost style DP with reusable subproblems.

LeetCode
3

Longest Common Subsequence

A foundational 2D DP for sequence comparison.

LeetCode
4

Edit Distance

Classic sequence-transformation DP used in matching systems.

LeetCode