Dynamic Programming

No questions match those filters.

1. 01 Best Time to Buy and Sell Stock Easy
2. 02 Climbing Stairs Easy
3. 03 Coin Change Medium
4. 04 Longest Increasing Subsequence Medium
5. 05 Longest Common Subsequence Medium
6. 06 Word Break Medium
7. 07 House Robber Medium
8. 08 House Robber II Medium
9. 09 Decode Ways Medium
10. 10 Unique Paths Medium
11. 11 Jump Game Medium
12. 12 Best Time to Buy and Sell Stock II Medium
13. 13 Best Time to Buy and Sell Stock with Cooldown Medium
14. 14 Partition Equal Subset Sum Medium
15. 15 Target Sum Medium
16. 16 Maximal Square Medium
17. 17 Edit Distance Hard
18. 18 Burst Balloons Hard
19. 19 Perfect Squares Medium
20. 20 Unique Paths II Medium
21. 21 Minimum Path Sum Medium
22. 22 Min Cost Climbing Stairs Easy
23. 23 Coin Change II Medium
24. 24 Interleaving String Hard
25. 25 Longest Increasing Path in a Matrix Hard
26. 26 Distinct Subsequences Hard
27. 27 Regular Expression Matching Hard
28. 28 Jump Game II Medium
29. 29 Longest Common Prefix Easy
30. 30 Best Time to Buy and Sell Stock III Hard
31. 31 Best Time to Buy and Sell Stock IV Hard
32. 32 Pascal's Triangle Easy
33. 33 Print Subsequences of a String Medium
34. 34 Fractional Knapsack Problem Medium
35. 35 Frog Jump Easy
36. 36 Ninja's Training (DP on Grids) Medium
37. 37 Unique Paths in a Grid Medium
38. 38 Minimum Path Sum in a Grid Medium
39. 39 Triangle - Fixed Starting Point Medium
40. 40 0/1 Knapsack Medium
41. 41 Coin Change (Minimum Coins) Medium
42. 42 Unbounded Knapsack Medium
43. 43 Longest Palindromic Subsequence Medium
44. 44 Wildcard Matching Hard
45. 45 Best Time to Buy and Sell Stock (DP variants I-IV) Hard
46. 46 Matrix Chain Multiplication Hard
47. 47 Longest Consecutive Subsequence Medium
48. 48 Longest Recurring Subsequence in a String Medium
49. 49 Print All Subsequences of a String Medium
50. 50 Word Break Problem Medium
51. 51 Count Palindromic Subsequences Hard
52. 52 Coin Change Problem Medium
53. 53 0/1 Knapsack Problem Medium
54. 54 Egg Dropping Problem Hard
55. 55 Find longest consecutive subsequence Medium
56. 56 Find the longest recurring subsequence in a string Medium
57. 57 Count all palindromic subsequences in a given string Hard
58. 58 Find the longest common subsequence between two strings Medium
59. 59 Knapsack Problem Medium
60. 60 Program for the Nth Catalan Number Medium
61. 61 Assembly Line Scheduling Problem Hard
62. 62 Longest Repeated Subsequence Medium
63. 63 Maximum Sum Increasing Subsequence Medium
64. 64 Count all subsequences having a product less than K Hard
65. 65 Longest subsequence where adjacent elements differ by one Medium
66. 66 Maximum subsequence sum such that no three are consecutive Medium
67. 67 Unbounded Knapsack (repetition of items allowed) Medium
68. 68 Longest alternating subsequence Medium
69. 69 Maximum Length of Pair Chain Medium