2,913 problems · Solve with AI-powered hints & explanations
| # | Title | Difficulty |
|---|---|---|
| 956 | Tallest Billboard | Hard |
| 957 | Prison Cells After N Days | Medium |
| 958 | Check Completeness of a Binary Tree |
Page 17 of 59
| Medium |
| 959 | Regions Cut By Slashes | Medium |
| 960 | Delete Columns to Make Sorted III | Hard |
| 961 | N-Repeated Element in Size 2N Array | Easy |
| 962 | Maximum Width Ramp | Medium |
| 963 | Minimum Area Rectangle II | Medium |
| 964 | Least Operators to Express Number | Hard |
| 965 | Univalued Binary Tree | Easy |
| 966 | Vowel Spellchecker | Medium |
| 967 | Numbers With Same Consecutive Differences | Medium |
| 968 | Binary Tree Cameras | Hard |
| 969 | Pancake Sorting | Medium |
| 970 | Powerful Integers | Medium |
| 971 | Flip Binary Tree To Match Preorder Traversal | Medium |
| 972 | Equal Rational Numbers | Hard |
| 973 | K Closest Points to Origin | Medium |
| 974 | Subarray Sums Divisible by K | Medium |
| 975 | Odd Even Jump | Hard |
| 976 | Largest Perimeter Triangle | Easy |
| 977 | Squares of a Sorted Array | Easy |
| 978 | Longest Turbulent Subarray | Medium |
| 979 | Distribute Coins in Binary Tree | Medium |
| 980 | Unique Paths III | Hard |
| 981 | Time Based Key-Value Store | Medium |
| 982 | Triples with Bitwise AND Equal To Zero | Hard |
| 983 | Minimum Cost For Tickets | Medium |
| 984 | String Without AAA or BBB | Medium |
| 985 | Sum of Even Numbers After Queries | Medium |
| 986 | Interval List Intersections | Medium |
| 987 | Vertical Order Traversal of a Binary Tree | Hard |
| 988 | Smallest String Starting From Leaf | Medium |
| 989 | Add to Array-Form of Integer | Easy |
| 990 | Satisfiability of Equality Equations | Medium |
| 991 | Broken Calculator | Medium |
| 992 | Subarrays with K Different Integers | Hard |
| 993 | Cousins in Binary Tree | Easy |
| 994 | Rotting Oranges | Medium |
| 995 | Minimum Number of K Consecutive Bit Flips | Hard |
| 996 | Number of Squareful Arrays | Hard |
| 997 | Find the Town Judge | Easy |
| 998 | Maximum Binary Tree II | Medium |
| 999 | Available Captures for Rook | Easy |
| 1000 | Minimum Cost to Merge Stones | Hard |
| 1001 | Grid Illumination | Hard |
| 1002 | Find Common Characters | Easy |
| 1003 | Check If Word Is Valid After Substitutions | Medium |
| 1004 | Max Consecutive Ones III | Medium |
| 1005 | Maximize Sum Of Array After K Negations | Easy |
© 2026 PhantomCodeAI. All rights reserved.