Practice problems across 75+ categories
Practice problems frequently asked at Dynamic Programming • 602 problems | 14 Easy | 295 Medium | 290 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 391 | Minimum Number of Valid Strings to Form Target II | Hard | ArrayStringBinary Search |
| 392 | Minimum Number of Visited Cells in a Grid | Hard | ArrayDynamic ProgrammingStack |
| 393 | Minimum Number of Work Sessions to Finish the Tasks | Medium | ArrayDynamic ProgrammingBacktracking |
| 394 | Minimum One Bit Operations to Make Integers Zero | Hard | Dynamic ProgrammingBit ManipulationMemoization |
| 395 | Minimum Operations to Make Array Equal to Target | Hard | ArrayDynamic ProgrammingStack |
| 396 | Minimum Operations to Make Binary Array Elements Equal to One II | Medium | ArrayDynamic ProgrammingGreedy |
| 397 | Minimum Operations to Make Character Frequencies Equal | Hard | Hash TableStringDynamic Programming |
| 398 | Minimum Operations to Make Elements Within K Subarrays Equal | Hard | ArrayHash TableMath |
| 399 | Minimum Operations to Reduce an Integer to 0 | Medium | Dynamic ProgrammingGreedyBit Manipulation |
| 400 | Minimum Path Cost in a Grid | Medium | ArrayDynamic ProgrammingMatrix |
| 401 | Minimum Path Sum | Medium | ArrayDynamic ProgrammingMatrix |
| 402 | Minimum Score Triangulation of Polygon | Medium | ArrayDynamic Programming |
| 403 | Minimum Sideway Jumps | Medium | ArrayDynamic ProgrammingGreedy |
| 404 | Minimum Skips to Arrive at Meeting On Time | Hard | ArrayDynamic Programming |
| 405 | Minimum Split Into Subarrays With GCD Greater Than One | 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.
