| 956 | Tallest Billboard | ArrayDynamic Programming | Hard |
| 957 | Prison Cells After N Days | ArrayHash TableMath+1 | Medium |
| 958 | Check Completeness of a Binary Tree | TreeBreadth-First SearchBinary Tree | Medium |
| 959 | Regions Cut By Slashes | ArrayHash TableDepth-First Search+3 | Medium |
| 960 | Delete Columns to Make Sorted III | ArrayStringDynamic Programming | Hard |
| 961 | N-Repeated Element in Size 2N Array | ArrayHash Table | Easy |
| 962 | Maximum Width Ramp | ArrayTwo PointersStack+1 | Medium |
| 963 | Minimum Area Rectangle II | ArrayHash TableMath+1 | Medium |
| 964 | Least Operators to Express Number | MathDynamic ProgrammingMemoization | Hard |
| 965 | Univalued Binary Tree | TreeDepth-First SearchBreadth-First Search+1 | Easy |
| 966 | Vowel Spellchecker | ArrayHash TableString | Medium |
| 967 | Numbers With Same Consecutive Differences | BacktrackingBreadth-First Search | Medium |
| 968 | Binary Tree Cameras | Dynamic ProgrammingTreeDepth-First Search+1 | Hard |
| 969 | Pancake Sorting | ArrayTwo PointersGreedy+1 | Medium |
| 970 | Powerful Integers | Hash TableMathEnumeration | Medium |
| 971 | Flip Binary Tree To Match Preorder Traversal | TreeDepth-First SearchBinary Tree | Medium |
| 972 | Equal Rational Numbers | MathString | Hard |
| 973 | K Closest Points to Origin | ArrayMathDivide and Conquer+4 | Medium |
| 974 | Subarray Sums Divisible by K | ArrayHash TablePrefix Sum | Medium |
| 975 | Odd Even Jump | ArrayDynamic ProgrammingStack+3 | Hard |
| 976 | Largest Perimeter Triangle | ArrayMathGreedy+1 | Easy |
| 977 | Squares of a Sorted Array | ArrayTwo PointersSorting | Easy |
| 978 | Longest Turbulent Subarray | ArrayDynamic ProgrammingSliding Window | Medium |
| 979 | Distribute Coins in Binary Tree | TreeDepth-First SearchBinary Tree | Medium |
| 980 | Unique Paths III | ArrayBacktrackingBit Manipulation+1 | Hard |
| 981 | Time Based Key-Value Store | Hash TableStringBinary Search+1 | Medium |
| 982 | Triples with Bitwise AND Equal To Zero | ArrayHash TableBit Manipulation | Hard |
| 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 |
| 987 | Vertical Order Traversal of a Binary Tree | Hash TableTreeDepth-First Search+3 | Hard |
| 988 | Smallest String Starting From Leaf | StringBacktrackingTree+2 | Medium |
| 989 | Add to Array-Form of Integer | ArrayMath | Easy |
| 990 | Satisfiability of Equality Equations | ArrayStringUnion Find+1 | Medium |
| 991 | Broken Calculator | MathGreedy | Medium |
| 992 | Subarrays with K Different Integers | ArrayHash TableSliding Window+1 | Hard |
| 993 | Cousins in Binary Tree | TreeDepth-First SearchBreadth-First Search+1 | Easy |
| 994 | Rotting Oranges | ArrayBreadth-First SearchMatrix | Medium |
| 995 | Minimum Number of K Consecutive Bit Flips | ArrayBit ManipulationQueue+2 | Hard |
| 996 | Number of Squareful Arrays | ArrayHash TableMath+4 | Hard |
| 997 | Find the Town Judge | ArrayHash TableGraph | Easy |
| 998 | Maximum Binary Tree II | TreeBinary Tree | Medium |
| 999 | Available Captures for Rook | ArrayMatrixSimulation | Easy |
| 1000 | Minimum Cost to Merge Stones | ArrayDynamic ProgrammingPrefix Sum | Hard |
| 1001 | Grid Illumination | ArrayHash Table | Hard |
| 1002 | Find Common Characters | ArrayHash TableString | Easy |
| 1003 | Check If Word Is Valid After Substitutions | StringStack | Medium |
| 1004 | Max Consecutive Ones III | ArrayBinary SearchSliding Window+1 | Medium |
| 1005 | Maximize Sum Of Array After K Negations | ArrayGreedySorting | Easy |