| 1006 | Clumsy Factorial | MathStackSimulation | Medium |
| 1007 | Minimum Domino Rotations For Equal Row | ArrayGreedy | Medium |
| 1008 | Construct Binary Search Tree from Preorder Traversal | ArrayStackTree+3 | Medium |
| 1009 | Complement of Base 10 Integer | Bit Manipulation | Easy |
| 1010 | Pairs of Songs With Total Durations Divisible by 60 | ArrayHash TableCounting | Medium |
| 1011 | Capacity To Ship Packages Within D Days | ArrayBinary Search | Medium |
| 1012 | Numbers With Repeated Digits | MathDynamic Programming | Hard |
| 1013 | Partition Array Into Three Parts With Equal Sum | ArrayGreedy | Easy |
| 1014 | Best Sightseeing Pair | ArrayDynamic Programming | Medium |
| 1015 | Smallest Integer Divisible by K | Hash TableMath | Medium |
| 1016 | Binary String With Substrings Representing 1 To N | Hash TableStringBit Manipulation+1 | Medium |
| 1017 | Convert to Base -2 | Math | Medium |
| 1018 | Binary Prefix Divisible By 5 | ArrayBit Manipulation | Easy |
| 1019 | Next Greater Node In Linked List | ArrayLinked ListStack+1 | Medium |
| 1020 | Number of Enclaves | ArrayDepth-First SearchBreadth-First Search+2 | Medium |
| 1021 | Remove Outermost Parentheses | StringStack | Easy |
| 1022 | Sum of Root To Leaf Binary Numbers | TreeDepth-First SearchBinary Tree | Easy |
| 1023 | Camelcase Matching | ArrayTwo PointersString+2 | Medium |
| 1024 | Video Stitching | ArrayDynamic ProgrammingGreedy | Medium |
| 1025 | Divisor Game | MathDynamic ProgrammingBrainteaser+1 | Easy |
| 1026 | Maximum Difference Between Node and Ancestor | TreeDepth-First SearchBinary Tree | Medium |
| 1027 | Longest Arithmetic Subsequence | ArrayHash TableBinary Search+1 | Medium |
| 1028 | Recover a Tree From Preorder Traversal | StringTreeDepth-First Search+1 | Hard |
| 1029 | Two City Scheduling | ArrayGreedySorting | Medium |
| 1030 | Matrix Cells in Distance Order | ArrayMathGeometry+2 | Easy |
| 1031 | Maximum Sum of Two Non-Overlapping Subarrays | ArrayDynamic ProgrammingSliding Window | Medium |
| 1032 | Stream of Characters | ArrayStringDesign+2 | Hard |
| 1033 | Moving Stones Until Consecutive | MathBrainteaser | Medium |
| 1034 | Coloring A Border | ArrayDepth-First SearchBreadth-First Search+1 | Medium |
| 1035 | Uncrossed Lines | ArrayDynamic Programming | Medium |
| 1036 | Escape a Large Maze | ArrayHash TableDepth-First Search+1 | Hard |
| 1037 | Valid Boomerang | ArrayMathGeometry | Easy |
| 1038 | Binary Search Tree to Greater Sum Tree | TreeDepth-First SearchBinary Search Tree+1 | Medium |
| 1039 | Minimum Score Triangulation of Polygon | ArrayDynamic Programming | Medium |
| 1040 | Moving Stones Until Consecutive II | ArrayMathSliding Window+1 | Medium |
| 1041 | Robot Bounded In Circle | MathStringSimulation | Medium |
| 1042 | Flower Planting With No Adjacent | Depth-First SearchBreadth-First SearchGraph | Medium |
| 1043 | Partition Array for Maximum Sum | ArrayDynamic Programming | Medium |
| 1044 | Longest Duplicate Substring | StringBinary SearchSliding Window+3 | Hard |
| 1045 | Customers Who Bought All Products | Database | Medium |
| 1046 | Last Stone Weight | ArrayHeap (Priority Queue) | Easy |
| 1047 | Remove All Adjacent Duplicates In String | StringStack | Easy |
| 1048 | Longest String Chain | ArrayHash TableTwo Pointers+3 | Medium |
| 1049 | Last Stone Weight II | ArrayDynamic Programming | Medium |
| 1050 | Actors and Directors Who Cooperated At Least Three Times | Database | Easy |
| 1051 | Height Checker | ArraySortingCounting Sort | Easy |
| 1052 | Grumpy Bookstore Owner | ArraySliding Window | Medium |
| 1053 | Previous Permutation With One Swap | ArrayGreedy | Medium |
| 1054 | Distant Barcodes | ArrayHash TableGreedy+3 | Medium |
| 1061 | Lexicographically Smallest Equivalent String | StringUnion Find | Medium |