| 70 | Climbing Stairs | — | Easy | MathDynamic ProgrammingMemoization | 53% | |
| 139 | Word Break | — | Medium | ArrayHash TableString | 48% | |
| 140 | Word Break II | — | Hard | ArrayHash TableString | 53% | |
| 241 | Different Ways to Add Parenthesesread | — | Medium | MathStringDynamic Programming | 72% | |
| 329 | Longest Increasing Path in a Matrix | — | Hard | ArrayDynamic ProgrammingDepth-First Search | 55% | |
| 397 | Integer Replacement | — | Medium | Dynamic ProgrammingGreedyBit Manipulation | 36% | |
| 464 | Can I Win | — | Medium | MathDynamic ProgrammingBit Manipulation | 30% | |
| 488 | Zuma Game | — | Hard | StringDynamic ProgrammingStack | 32% | |
| 509 | Fibonacci Number | — | Easy | MathDynamic ProgrammingRecursion | 73% | |
| 546 | Remove Boxes | — | Hard | ArrayDynamic ProgrammingMemoization | 48% | |
| 638 | Shopping Offers | — | Medium | ArrayDynamic ProgrammingBacktracking | 52% | |
| 691 | Stickers to Spell Word | — | Hard | ArrayHash TableString | 50% | |
| 698 | Partition to K Equal Sum Subsets | — | Medium | ArrayDynamic ProgrammingBacktracking | 38% | |
| 773 | Sliding Puzzleread | — | Hard | ArrayDynamic ProgrammingBacktracking | 73% | |
| 894 | All Possible Full Binary Trees | — | Medium | Dynamic ProgrammingTreeRecursion | 83% | |
| 913 | Cat and Mouse | — | Hard | MathDynamic ProgrammingGraph | 34% | |
| 964 | Least Operators to Express Number | — | Hard | MathDynamic ProgrammingMemoization | 48% | |
| 1137 | N-th Tribonacci Numberread | — | Easy | MathDynamic ProgrammingMemoization | 64% | |
| 1387 | Sort Integers by The Power Valueread | — | Medium | Dynamic ProgrammingMemoizationSorting | 71% | |
| 1444 | Number of Ways of Cutting a Pizza | — | Hard | ArrayDynamic ProgrammingMemoization | 62% | |
| 1553 | Minimum Number of Days to Eat N Oranges | — | Hard | Dynamic ProgrammingMemoization | 36% | |
| 1569 | Number of Ways to Reorder Array to Get Same BST | — | Hard | ArrayMathDivide and Conquer | 54% | |
| 1575 | Count All Possible Routes | — | Hard | ArrayDynamic ProgrammingMemoization | 65% | |
| 1611 | Minimum One Bit Operations to Make Integers Zero | — | Hard | Dynamic ProgrammingBit ManipulationMemoization | 73% | |
| 1659 | Maximize Grid Happiness | — | Hard | Dynamic ProgrammingBit ManipulationMemoization | 40% | |
| 1728 | Cat and Mouse II | — | Hard | ArrayMathDynamic Programming | 40% | |
| 1815 | Maximum Number of Groups Getting Fresh Donutsread | — | Hard | ArrayDynamic ProgrammingBit Manipulation | 40% | |
| 1857 | Largest Color Value in a Directed Graph | — | Hard | Hash TableDynamic ProgrammingGraph | 49% | |
| 1900 | The Earliest and Latest Rounds Where Players Compete | — | Hard | Dynamic ProgrammingMemoization | 48% | |
| 2019 | The Score of Students Solving Math Expression | — | Hard | ArrayMathString | 33% | |
| 2311 | Longest Binary Subsequence Less Than or Equal to K | — | Medium | StringDynamic ProgrammingGreedy | 38% | |
| 2312 | Selling Pieces of Wood | — | Hard | ArrayDynamic ProgrammingMemoization | 52% | |
| 2318 | Number of Distinct Roll Sequences | — | Hard | Dynamic ProgrammingMemoization | 57% | |
| 2328 | Number of Increasing Paths in a Grid | — | Hard | ArrayDynamic ProgrammingDepth-First Search | 58% | |
| 2713 | Maximum Strictly Increasing Cells in a Matrixread | — | Hard | ArrayHash TableBinary Search | 31% | |
| 2876 | Count Visited Nodes in a Directed Graph | — | Hard | Dynamic ProgrammingGraphMemoization | 29% | |
| 2920 | Maximum Points After Collecting Coins From All Nodes | — | Hard | ArrayDynamic ProgrammingBit Manipulation | 36% | |
| 2998 | Minimum Number of Operations to Make X and Y Equal | — | Medium | Dynamic ProgrammingBreadth-First SearchMemoization | 47% | |
| 3040 | Maximum Number of Operations With the Same Score II | — | Medium | ArrayDynamic ProgrammingMemoization | 33% | |
| 3154 | Find Number of Ways to Reach the K-th Stair | — | Hard | MathDynamic ProgrammingBit Manipulation | 36% | |
| 3459 | Length of Longest V-Shaped Diagonal Segment | — | Hard | ArrayDynamic ProgrammingMemoization | 34% | |