Practice problems across 75+ categories
Practice problems frequently asked at Dynamic Programming • 602 problems | 14 Easy | 295 Medium | 290 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 316 | Maximum Strength of K Disjoint Subarrays | Hard | ArrayDynamic ProgrammingPrefix Sum |
| 317 | Maximum Strictly Increasing Cells in a Matrix | Hard | ArrayHash TableBinary Search |
| 318 | Maximum Students Taking Exam | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 319 | Maximum Subarray | Medium | ArrayDivide and ConquerDynamic Programming |
| 320 | Maximum Subarray Sum After One Operation | Medium | ArrayDynamic Programming |
| 321 | Maximum Subarray Sum with One Deletion | Medium | ArrayDynamic Programming |
| 322 | Maximum Subtree of the Same Color | Medium | ArrayDynamic ProgrammingTree |
| 323 | Maximum Sum BST in Binary Tree | Hard | Dynamic ProgrammingTreeDepth-First Search |
| 324 | Maximum Sum Circular Subarray | Medium | ArrayDivide and ConquerDynamic Programming |
| 325 | Maximum Sum of 3 Non-Overlapping Subarrays | Hard | ArrayDynamic ProgrammingSliding Window |
| 326 | Maximum Sum of Subsequence With Non-adjacent Elements | Hard | ArrayDivide and ConquerDynamic Programming |
| 327 | Maximum Sum of Two Non-Overlapping Subarrays | Medium | ArrayDynamic ProgrammingSliding Window |
| 328 | Maximum Total Damage With Spell Casting | Medium | ArrayHash TableTwo Pointers |
| 329 | Maximum Total Reward Using Operations I | Medium | ArrayDynamic Programming |
| 330 | Maximum Total Reward Using Operations II | Hard | ArrayDynamic ProgrammingBit Manipulation |
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.
