Practice problems across 75+ categories
Practice problems frequently asked at Dynamic Programming • 602 problems | 14 Easy | 295 Medium | 290 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 76 | Count of Sub-Multisets With Bounded Sum | Hard | ArrayHash TableDynamic Programming |
| 77 | Count Palindromic Subsequences | Hard | StringDynamic Programming |
| 78 | Count Partitions With Max-Min Difference at Most K | Medium | ArrayDynamic ProgrammingQueue |
| 79 | Count Paths That Can Form a Palindrome in a Tree | Hard | Dynamic ProgrammingBit ManipulationTree |
| 80 | Count Paths With the Given XOR Value | Medium | ArrayDynamic ProgrammingBit Manipulation |
| 81 | Count Sorted Vowel Strings | Medium | MathDynamic ProgrammingCombinatorics |
| 82 | Count Special Integers | Hard | MathDynamic Programming |
| 83 | Count Square Submatrices with All Ones | Medium | ArrayDynamic ProgrammingMatrix |
| 84 | Count Stepping Numbers in Range | Hard | StringDynamic Programming |
| 85 | Count Strictly Increasing Subarrays | Medium | ArrayMathDynamic Programming |
| 86 | Count Submatrices With All Ones | Medium | ArrayDynamic ProgrammingStack |
| 87 | Count Substrings Divisible By Last Digit | Hard | StringDynamic Programming |
| 88 | Count Substrings That Differ by One Character | Medium | Hash TableStringDynamic Programming |
| 89 | Count Subtrees With Max Distance Between Cities | Hard | Dynamic ProgrammingBit ManipulationTree |
| 90 | Count the Number of Ideal Arrays | Hard | MathDynamic ProgrammingCombinatorics |
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.
