| 983 | Minimum Cost For Tickets | ArrayDynamic Programming | Medium |
| 984 | String Without AAA or BBB | StringGreedy | Medium |
| 985 | Sum of Even Numbers After Queries | ArraySimulation | Medium |
| 986 | Interval List Intersections | ArrayTwo PointersLine Sweep | Medium |
| 988 | Smallest String Starting From Leaf | StringBacktrackingTree+2 | Medium |
| 990 | Satisfiability of Equality Equations | ArrayStringUnion Find+1 | Medium |
| 991 | Broken Calculator | MathGreedy | Medium |
| 994 | Rotting Oranges | ArrayBreadth-First SearchMatrix | Medium |
| 998 | Maximum Binary Tree II | TreeBinary Tree | Medium |
| 1003 | Check If Word Is Valid After Substitutions | StringStack | Medium |
| 1004 | Max Consecutive Ones III | ArrayBinary SearchSliding Window+1 | Medium |
| 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 |
| 1010 | Pairs of Songs With Total Durations Divisible by 60 | ArrayHash TableCounting | Medium |
| 1011 | Capacity To Ship Packages Within D Days | ArrayBinary Search | Medium |
| 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 |
| 1019 | Next Greater Node In Linked List | ArrayLinked ListStack+1 | Medium |
| 1020 | Number of Enclaves | ArrayDepth-First SearchBreadth-First Search+2 | Medium |
| 1023 | Camelcase Matching | ArrayTwo PointersString+2 | Medium |
| 1024 | Video Stitching | ArrayDynamic ProgrammingGreedy | Medium |
| 1026 | Maximum Difference Between Node and Ancestor | TreeDepth-First SearchBinary Tree | Medium |
| 1027 | Longest Arithmetic Subsequence | ArrayHash TableBinary Search+1 | Medium |
| 1029 | Two City Scheduling | ArrayGreedySorting | Medium |
| 1031 | Maximum Sum of Two Non-Overlapping Subarrays | ArrayDynamic ProgrammingSliding Window | Medium |
| 1033 | Moving Stones Until Consecutive | MathBrainteaser | Medium |
| 1034 | Coloring A Border | ArrayDepth-First SearchBreadth-First Search+1 | Medium |
| 1035 | Uncrossed Lines | ArrayDynamic Programming | Medium |
| 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 |
| 1045 | Customers Who Bought All Products | Database | Medium |
| 1048 | Longest String Chain | ArrayHash TableTwo Pointers+3 | Medium |
| 1049 | Last Stone Weight II | ArrayDynamic Programming | Medium |
| 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 |
| 1070 | Product Sales Analysis III | Database | Medium |
| 1072 | Flip Columns For Maximum Number of Equal Rows | ArrayHash TableMatrix | Medium |
| 1073 | Adding Two Negabinary Numbers | ArrayMath | Medium |
| 1079 | Letter Tile Possibilities | Hash TableStringBacktracking+1 | Medium |
| 1080 | Insufficient Nodes in Root to Leaf Paths | TreeDepth-First SearchBinary Tree | Medium |
| 1081 | Smallest Subsequence of Distinct Characters | StringStackGreedy+1 | Medium |