Practice problems across 75+ categories
Practice problems frequently asked at Dynamic Programming • 602 problems | 14 Easy | 295 Medium | 290 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 361 | Minimum Cost to Divide Array Into Subarrays | Hard | ArrayDynamic ProgrammingPrefix Sum |
| 362 | Minimum Cost to Make All Characters Equal | Medium | StringDynamic ProgrammingGreedy |
| 363 | Minimum Cost to Merge Stones | Hard | ArrayDynamic ProgrammingPrefix Sum |
| 364 | Minimum Cost to Reach Destination in Time | Hard | ArrayDynamic ProgrammingGraph |
| 365 | Minimum Cost to Separate Sentence Into Rows | Medium | ArrayDynamic Programming |
| 366 | Minimum Cost to Split an Array | Hard | ArrayHash TableDynamic Programming |
| 367 | Minimum Cost Tree From Leaf Values | Medium | ArrayDynamic ProgrammingStack |
| 368 | Minimum Costs Using the Train Line | Hard | ArrayDynamic Programming |
| 369 | Minimum Deletions to Make String Balanced | Medium | StringDynamic ProgrammingStack |
| 370 | Minimum Difference in Sums After Removal of Elements | Hard | ArrayDynamic ProgrammingHeap (Priority Queue) |
| 371 | Minimum Difficulty of a Job Schedule | Hard | ArrayDynamic Programming |
| 372 | Minimum Distance to Type a Word Using Two Fingers | Hard | StringDynamic Programming |
| 373 | Minimum Edge Reversals So Every Node Is Reachable | Hard | Dynamic ProgrammingDepth-First SearchBreadth-First Search |
| 374 | Minimum Falling Path Sum | Medium | ArrayDynamic ProgrammingMatrix |
| 375 | Minimum Falling Path Sum II | Hard | ArrayDynamic ProgrammingMatrix |
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.
