| 1143 | Longest Common Subsequence | Medium |
| 1155 | Number of Dice Rolls With Target Sum | Medium |
| 1220 | Count Vowels Permutation | Hard |
| 1235 | Maximum Profit in Job Scheduling | Hard |
| 1269 | Number of Ways to Stay in the Same Place After Some Steps | Hard |
| 1289 | Minimum Falling Path Sum II | Hard |
| 1335 | Minimum Difficulty of a Job Schedule | Hard |
| 1359 | Count All Valid Pickup and Delivery Options | Hard |
| 1420 | Build Array Where You Can Find The Maximum Exactly K Comparisons | Hard |
| 1425 | Constrained Subsequence Sum | Hard |
| 1458 | Max Dot Product of Two Subsequences | Hard |
| 1493 | Longest Subarray of 1's After Deleting One Element | Medium |
| 1531 | String Compression II | Hard |
| 1578 | Minimum Time to Make Rope Colorful | Medium |
| 1653 | Minimum Deletions to Make String Balanced | Medium |
| 1751 | Maximum Number of Events That Can Be Attended II | Hard |
| 1774 | Closest Dessert Cost | Medium |
| 1824 | Minimum Sideway Jumps | Medium |
| 1879 | Minimum XOR Sum of Two Arrays | Hard |
| 1884 | Egg Drop With 2 Eggs and N Floors | Medium |
| 2050 | Parallel Courses III | Hard |
| 2140 | Solving Questions With Brainpower | Medium |
| 2147 | Number of Ways to Divide a Long Corridor | Hard |
| 2305 | Fair Distribution of Cookies | Medium |
| 2320 | Count Number of Ways to Place Houses | Medium |
| 2369 | Check if There is a Valid Partition For The Array | Medium |
| 2400 | Number of Ways to Reach a Position After Exactly k Steps | Medium |
| 2466 | Count Ways To Build Good Strings | Medium |
| 2707 | Extra Characters in a String | Medium |
| 2742 | Painting the Walls | Hard |