| 1269 | Number of Ways to Stay in the Same Place After Some Steps | Dynamic Programming | Hard |
| 1278 | Palindrome Partitioning III | StringDynamic Programming | Hard |
| 1284 | Minimum Number of Flips to Convert Binary Matrix to Zero Matrix | ArrayHash TableBit Manipulation+2 | Hard |
| 1289 | Minimum Falling Path Sum II | ArrayDynamic ProgrammingMatrix | Hard |
| 1293 | Shortest Path in a Grid with Obstacles Elimination | ArrayBreadth-First SearchMatrix | Hard |
| 1298 | Maximum Candies You Can Get from Boxes | ArrayBreadth-First SearchGraph | Hard |
| 1301 | Number of Paths with Max Score | ArrayDynamic ProgrammingMatrix | Hard |
| 1307 | Verbal Arithmetic Puzzle | ArrayMathString+1 | Hard |
| 1312 | Minimum Insertion Steps to Make a String Palindrome | StringDynamic Programming | Hard |
| 1316 | Distinct Echo Substrings | StringTrieRolling Hash+1 | Hard |
| 1320 | Minimum Distance to Type a Word Using Two Fingers | StringDynamic Programming | Hard |
| 1326 | Minimum Number of Taps to Open to Water a Garden | ArrayDynamic ProgrammingGreedy | Hard |
| 1330 | Reverse Subarray To Maximize Array Value | ArrayMathGreedy | Hard |
| 1335 | Minimum Difficulty of a Job Schedule | ArrayDynamic Programming | Hard |
| 1340 | Jump Game V | ArrayDynamic ProgrammingSorting | Hard |
| 1345 | Jump Game IV | ArrayHash TableBreadth-First Search | Hard |
| 1349 | Maximum Students Taking Exam | ArrayDynamic ProgrammingBit Manipulation+2 | Hard |
| 1354 | Construct Target Array With Multiple Sums | ArrayHeap (Priority Queue) | Hard |
| 1359 | Count All Valid Pickup and Delivery Options | MathDynamic ProgrammingCombinatorics | Hard |
| 1363 | Largest Multiple of Three | ArrayMathDynamic Programming+2 | Hard |
| 1368 | Minimum Cost to Make at Least One Valid Path in a Grid | ArrayBreadth-First SearchGraph+3 | Hard |
| 1373 | Maximum Sum BST in Binary Tree | Dynamic ProgrammingTreeDepth-First Search+2 | Hard |
| 1377 | Frog Position After T Seconds | TreeDepth-First SearchBreadth-First Search+1 | Hard |
| 1383 | Maximum Performance of a Team | ArrayGreedySorting+1 | Hard |
| 1388 | Pizza With 3n Slices | ArrayDynamic ProgrammingGreedy+1 | Hard |
| 1392 | Longest Happy Prefix | StringRolling HashString Matching+1 | Hard |
| 1397 | Find All Good Strings | StringDynamic ProgrammingString Matching | Hard |
| 1402 | Reducing Dishes | ArrayDynamic ProgrammingGreedy+1 | Hard |
| 1406 | Stone Game III | ArrayMathDynamic Programming+1 | Hard |
| 1411 | Number of Ways to Paint N × 3 Grid | Dynamic Programming | Hard |
| 1416 | Restore The Array | StringDynamic Programming | Hard |
| 1420 | Build Array Where You Can Find The Maximum Exactly K Comparisons | Dynamic ProgrammingPrefix Sum | Hard |
| 1425 | Constrained Subsequence Sum | ArrayDynamic ProgrammingQueue+3 | Hard |
| 1434 | Number of Ways to Wear Different Hats to Each Other | ArrayDynamic ProgrammingBit Manipulation+1 | Hard |
| 1439 | Find the Kth Smallest Sum of a Matrix With Sorted Rows | ArrayBinary SearchHeap (Priority Queue)+1 | Hard |
| 1444 | Number of Ways of Cutting a Pizza | ArrayDynamic ProgrammingMemoization+2 | Hard |
| 1449 | Form Largest Integer With Digits That Add up to Target | ArrayDynamic Programming | Hard |
| 1453 | Maximum Number of Darts Inside of a Circular Dartboard | ArrayMathGeometry | Hard |
| 1458 | Max Dot Product of Two Subsequences | ArrayDynamic Programming | Hard |
| 1463 | Cherry Pickup II | ArrayDynamic ProgrammingMatrix | Hard |
| 1467 | Probability of a Two Boxes Having The Same Number of Distinct Balls | ArrayMathDynamic Programming+3 | Hard |
| 1473 | Paint House III | ArrayDynamic Programming | Hard |
| 1478 | Allocate Mailboxes | ArrayMathDynamic Programming+1 | Hard |
| 1483 | Kth Ancestor of a Tree Node | Binary SearchDynamic ProgrammingTree+3 | Hard |
| 1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Union FindGraphSorting+2 | Hard |
| 1494 | Parallel Courses II | Dynamic ProgrammingBit ManipulationGraph+1 | Hard |
| 1499 | Max Value of Equation | ArrayQueueSliding Window+2 | Hard |
| 1505 | Minimum Possible Integer After at Most K Adjacent Swaps On Digits | StringGreedyBinary Indexed Tree+1 | Hard |
| 1510 | Stone Game IV | MathDynamic ProgrammingGame Theory | Hard |
| 1515 | Best Position for a Service Centre | ArrayMathGeometry+1 | Hard |