57 problems

Dynamic Programming interview problems

57 Dynamic Programming problems, from easy to hard. Each one has an editorial explaining the approach and its complexity, and a visualizer that runs the solution step by step on the example input or your own.

Easy (5)

Medium (30)

50. Maximum SubarrayMedium
59. Unique PathsMedium
60. Unique Paths IIMedium
61. Minimum Path SumMedium
69. Edit DistanceMedium
85. Decode WaysMedium
88. Interleaving StringMedium
108. TriangleMedium
127. Word BreakMedium
139. Maximum Product SubarrayMedium
156. House RobberMedium
169. House Robber IIMedium
176. Maximal SquareMedium
210. Longest Increasing SubsequenceMedium
216. Best Time to Buy and Sell Stock with CooldownMedium
218. Coin ChangeMedium
231. Combination Sum IVMedium
242. Partition Equal Subset SumMedium
259. Target SumMedium
264. Coin Change IIMedium
288. Best Time to Buy and Sell Stock with Transaction FeeMedium
311. Stone GameMedium
315. Maximum Sum Circular SubarrayMedium
327. Last Stone Weight IIMedium
330. Stone Game IIMedium
331. Longest Common SubsequenceMedium
351. Number of Sets of K Non-Overlapping Line SegmentsMedium
356. Stone Game VIIMedium
357. Jump Game VIMedium
362. Jump Game VIIMedium

Hard (22)

All topics · All problems