1,464 problems · Solve with AI-powered hints & explanations
| # | Title | Difficulty |
|---|---|---|
| 983 | Minimum Cost For Tickets | Medium |
| 984 | String Without AAA or BBB | Medium |
| 985 | Sum of Even Numbers After Queries | Medium |
Page 10 of 30
| 986 | Interval List Intersections | Medium |
| 988 | Smallest String Starting From Leaf | Medium |
| 990 | Satisfiability of Equality Equations | Medium |
| 991 | Broken Calculator | Medium |
| 994 | Rotting Oranges | Medium |
| 998 | Maximum Binary Tree II | Medium |
| 1003 | Check If Word Is Valid After Substitutions | Medium |
| 1004 | Max Consecutive Ones III | Medium |
| 1006 | Clumsy Factorial | Medium |
| 1007 | Minimum Domino Rotations For Equal Row | Medium |
| 1008 | Construct Binary Search Tree from Preorder Traversal | Medium |
| 1010 | Pairs of Songs With Total Durations Divisible by 60 | Medium |
| 1011 | Capacity To Ship Packages Within D Days | Medium |
| 1014 | Best Sightseeing Pair | Medium |
| 1015 | Smallest Integer Divisible by K | Medium |
| 1016 | Binary String With Substrings Representing 1 To N | Medium |
| 1017 | Convert to Base -2 | Medium |
| 1019 | Next Greater Node In Linked List | Medium |
| 1020 | Number of Enclaves | Medium |
| 1023 | Camelcase Matching | Medium |
| 1024 | Video Stitching | Medium |
| 1026 | Maximum Difference Between Node and Ancestor | Medium |
| 1027 | Longest Arithmetic Subsequence | Medium |
| 1029 | Two City Scheduling | Medium |
| 1031 | Maximum Sum of Two Non-Overlapping Subarrays | Medium |
| 1033 | Moving Stones Until Consecutive | Medium |
| 1034 | Coloring A Border | Medium |
| 1035 | Uncrossed Lines | Medium |
| 1038 | Binary Search Tree to Greater Sum Tree | Medium |
| 1039 | Minimum Score Triangulation of Polygon | Medium |
| 1040 | Moving Stones Until Consecutive II | Medium |
| 1041 | Robot Bounded In Circle | Medium |
| 1042 | Flower Planting With No Adjacent | Medium |
| 1043 | Partition Array for Maximum Sum | Medium |
| 1045 | Customers Who Bought All Products | Medium |
| 1048 | Longest String Chain | Medium |
| 1049 | Last Stone Weight II | Medium |
| 1052 | Grumpy Bookstore Owner | Medium |
| 1053 | Previous Permutation With One Swap | Medium |
| 1054 | Distant Barcodes | Medium |
| 1061 | Lexicographically Smallest Equivalent String | Medium |
| 1070 | Product Sales Analysis III | Medium |
| 1072 | Flip Columns For Maximum Number of Equal Rows | Medium |
| 1073 | Adding Two Negabinary Numbers | Medium |
| 1079 | Letter Tile Possibilities | Medium |
| 1080 | Insufficient Nodes in Root to Leaf Paths | Medium |
| 1081 | Smallest Subsequence of Distinct Characters | Medium |
© 2026 PhantomCodeAI. All rights reserved.