Dynamic Programming problems

40 Dynamic Programming DSA practice problems on CampusCode, each with statement, examples and constraints.

• 611. Maximal Rectangle in Binary Matrix Medium Stack
• 619. Sum of Subarray Minimums Medium Stack
• 620. Sum of Subarray Maximums Medium Stack
• 623. Jump Game VI (DP + Monotonic Deque) Medium Stack
• 637. Longest Valid Parentheses Medium Stack
• 641. Perfect Squares Medium Stack
• 644. Constrained Subsequence Sum Medium Stack
• 645. Minimum Cost Tree From Leaf Values Medium Stack
• 655. Maximal Rectangle Hard Stack
• 661. Count Submatrices With All Ones Hard Stack
• 664. Maximum Score From Multiplication Operations Hard Stack
• 670. Minimum Cost Jump Game (Monotonic Queue DP) Hard Stack
• 671. Minimum Cost to Cut a Stick Hard Stack
• 683. Minimum Cost to Reach Destination in Time Hard Stack
• 954. Number of Longest Increasing Subsequences Hard Trees
• 1025. Count Paths from Source to Destination in DAG Easy Graphs
• 1029. Floyd-Warshall All-Pairs Shortest Path Medium Graphs
• 1032. Cheapest Flights Within K Stops Medium Graphs
• 1073. Number of Ways to Arrive at Destination Medium Graphs
• 1076. Dijkstra with State — Minimum Cost with K Stops Hard Graphs
• 1078. Johnson's Algorithm — All-Pairs on Sparse Graph Hard Graphs
• 1079. Minimum Cost Path with At Most K Edges (DP+Graph) Hard Graphs
• 1089. Parallel Courses III — Maximum Time with Dependencies Hard Graphs
• 1097. Number of Restricted Paths Hard Graphs
• 1100. Cherry Pickup II — Two Robots Hard Graphs
• 1102. Number of Increasing Paths in Grid Hard Graphs
• 1103. Course Schedule IV — Reachability Queries Hard Graphs
• 1107. Hamiltonian Path Existence (Bitmask DP) Hard Graphs
• 1108. Travelling Salesman Problem (Bitmask DP) Hard Graphs
• 1109. Count Hamiltonian Paths in DAG (Bitmask DP) Hard Graphs
• 1111. General Graph Maximum Matching Hard Graphs
• 1318. Counting Bits — DP + Bit Easy Bit Manipulation
• 1327. Count Subsets with Given XOR Medium Bit Manipulation
• 1328. Count Subsets with Given AND Value Medium Bit Manipulation
• 1331. Partition Array into Two Subsets with Min Diff Medium Bit Manipulation
• 1346. Count Ways to Distribute Candies Medium Bit Manipulation
• 1347. Count Strings Without Consecutive 1s Medium Bit Manipulation
• 1381. Count All Valid Pickup Delivery Orders Hard Bit Manipulation
• 1382. Find Minimum Number of Coins for Each Amount Hard Bit Manipulation
• 1385. Parallel Courses III — Bitmask Scheduling Hard Bit Manipulation