Practice problems across 75+ categories
Practice problems frequently asked at Dynamic Programming • 602 problems | 14 Easy | 295 Medium | 290 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 256 | Maximize Grid Happiness | Hard | Dynamic ProgrammingBit ManipulationMemoization |
| 257 | Maximize Palindrome Length From Subsequences | Hard | StringDynamic Programming |
| 258 | Maximize Score After N Operations | Hard | ArrayMathDynamic Programming |
| 259 | Maximize Subarray Sum After Removing All Occurrences of One Element | Hard | ArrayDynamic ProgrammingSegment Tree |
| 260 | Maximize Sum of Weights after Edge Removals | Hard | Dynamic ProgrammingTreeDepth-First Search |
| 261 | Maximize the Number of Partitions After Operations | Hard | StringDynamic ProgrammingBit Manipulation |
| 262 | Maximize the Profit as the Salesman | Medium | ArrayHash TableBinary Search |
| 263 | Maximize Total Cost of Alternating Subarrays | Medium | ArrayDynamic Programming |
| 264 | Maximize Total Tastiness of Purchased Fruits | Medium | ArrayDynamic Programming |
| 265 | Maximize Value of Function in a Ball Passing Game | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 266 | Maximum Absolute Sum of Any Subarray | Medium | ArrayDynamic Programming |
| 267 | Maximum Alternating Subarray Sum | Medium | ArrayDynamic Programming |
| 268 | Maximum Alternating Subsequence Sum | Medium | ArrayDynamic Programming |
| 269 | Maximum Amount of Money Robot Can Earn | Medium | ArrayDynamic ProgrammingMatrix |
| 270 | Maximum and Minimum Sums of at Most Size K Subsequences | Medium | ArrayMathDynamic Programming |
Powerful online tools to boost your productivity
Coding Ground For Developers
Code, Edit, Run and ShareIgnite your coding potential on Coding Ground - an immersive online platform for hands-on learning, collaboration, and skill development.
