Practice problems across 75+ categories
Practice problems frequently asked at Dynamic Programming • 602 problems | 14 Easy | 295 Medium | 290 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 421 | Minimum Window Subsequence | Hard | StringDynamic ProgrammingSliding Window |
| 422 | Minimum XOR Sum of Two Arrays | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 423 | Most Expensive Item That Can Not Be Bought | Medium | MathDynamic ProgrammingNumber Theory |
| 424 | N-th Tribonacci Number | Easy | MathDynamic ProgrammingMemoization |
| 425 | New 21 Game | Medium | MathDynamic ProgrammingSliding Window |
| 426 | Non-negative Integers without Consecutive Ones | Hard | Dynamic Programming |
| 427 | Non-overlapping Intervals | Medium | ArrayDynamic ProgrammingGreedy |
| 428 | Number of Beautiful Integers in the Range | Hard | MathDynamic Programming |
| 429 | Number of Beautiful Partitions | Hard | StringDynamic ProgrammingPrefix Sum |
| 430 | Number Of Corner Rectangles | Medium | ArrayMathDynamic Programming |
| 431 | Number of Dice Rolls With Target Sum | Medium | Dynamic Programming |
| 432 | Number of Digit One | Hard | MathDynamic ProgrammingRecursion |
| 433 | Number of Distinct Roll Sequences | Hard | Dynamic ProgrammingMemoization |
| 434 | Number of Good Binary Strings | Medium | Dynamic Programming |
| 435 | Number of Good Ways to Split a String | Medium | Hash TableStringDynamic 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.
