Practice problems across 75+ categories
Practice problems frequently asked at Memoization • 43 problems | 3 Easy | 12 Medium | 27 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 16 | Length of Longest V-Shaped Diagonal Segment | Hard | ArrayDynamic ProgrammingMemoization |
| 17 | Longest Binary Subsequence Less Than or Equal to K | Medium | StringDynamic ProgrammingGreedy |
| 18 | Longest Increasing Path in a Matrix | Hard | ArrayDynamic ProgrammingDepth-First Search |
| 19 | Maximize Grid Happiness | Hard | Dynamic ProgrammingBit ManipulationMemoization |
| 20 | Maximum Number of Groups Getting Fresh Donuts | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 21 | Maximum Number of Operations With the Same Score II | Medium | ArrayDynamic ProgrammingMemoization |
| 22 | Maximum Points After Collecting Coins From All Nodes | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 23 | Maximum Strictly Increasing Cells in a Matrix | Hard | ArrayHash TableBinary Search |
| 24 | Minimum Number of Days to Eat N Oranges | Hard | Dynamic ProgrammingMemoization |
| 25 | Minimum Number of Operations to Make X and Y Equal | Medium | Dynamic ProgrammingBreadth-First SearchMemoization |
| 26 | Minimum One Bit Operations to Make Integers Zero | Hard | Dynamic ProgrammingBit ManipulationMemoization |
| 27 | N-th Tribonacci Number | Easy | MathDynamic ProgrammingMemoization |
| 28 | Number of Distinct Roll Sequences | Hard | Dynamic ProgrammingMemoization |
| 29 | Number of Increasing Paths in a Grid | Hard | ArrayDynamic ProgrammingDepth-First Search |
| 30 | Number of Ways of Cutting a Pizza | Hard | ArrayDynamic ProgrammingMemoization |
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.
