| Broken Calculator | Medium | 55.9% | 100.0% | MathGreedy |
| Maximum Sum of an Hourglass | Medium | 76.4% | 100.0% | ArrayMatrixPrefix Sum |
| Swap For Longest Repeated Character Substring | Medium | 44.2% | 100.0% | Hash TableStringSliding Window |
| Online Majority Element In Subarray | Hard | 40.1% | 100.0% | ArrayBinary SearchDesign+2 |
| Partitioning Into Minimum Number Of Deci-Binary Numbers | Medium | 88.8% | 100.0% | StringGreedy |
| Minimum Processing Time | Medium | 70.2% | 100.0% | ArrayGreedySorting |
| Grumpy Bookstore Owner | Medium | 64.0% | 100.0% | ArraySliding Window |
| Car Fleet | Medium | 54.8% | 100.0% | ArrayStackSorting+1 |
| Check If Word Is Valid After Substitutions | Medium | 61.1% | 100.0% | StringStack |
| Delivering Boxes from Storage to Ports | Hard | 40.1% | 100.0% | ArrayDynamic ProgrammingSegment Tree+4 |
| Detect Cycles in 2D Grid | Medium | 52.5% | 100.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Convert Binary Number in a Linked List to Integer | Easy | 82.3% | 90.2% | Linked ListMath |
| Merge Intervals | Medium | 51.2% | 90.2% | ArraySorting |
| LRU Cache | Medium | 46.8% | 85.9% | Hash TableLinked ListDesign+1 |
| Sliding Window Maximum | Hard | 48.5% | 80.9% | ArrayQueueSliding Window+2 |
| Group Anagrams | Medium | 72.2% | 74.8% | ArrayHash TableString+1 |
| Rotate Image | Medium | 79.4% | 74.8% | ArrayMathMatrix |
| Increasing Triplet Subsequence | Medium | 39.2% | 74.8% | ArrayGreedy |
| Valid Number | Hard | 22.6% | 74.8% | String |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.2% | 66.9% | TreeBreadth-First SearchBinary Tree |
| Decode String | Medium | 62.3% | 66.9% | StringStackRecursion |
| Search a 2D Matrix | Medium | 53.6% | 66.9% | ArrayBinary SearchMatrix |
| Task Scheduler | Medium | 62.7% | 66.9% | ArrayHash TableGreedy+3 |
| Spiral Matrix | Medium | 56.2% | 66.9% | ArrayMatrixSimulation |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 66.9% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Maximum Frequency Stack | Hard | 66.6% | 66.9% | Hash TableStackDesign+1 |
| Search in Rotated Sorted Array | Medium | 44.1% | 66.9% | ArrayBinary Search |
| Reverse Linked List II | Medium | 51.0% | 66.9% | Linked List |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 66.9% | ArrayDynamic ProgrammingDepth-First Search+5 |
| Best Sightseeing Pair | Medium | 62.7% | 66.9% | ArrayDynamic Programming |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 66.9% | StringTreeDepth-First Search+3 |
| Max Stack | Hard | 45.9% | 66.9% | Linked ListStackDesign+2 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 66.9% | Hash TableStringSliding Window |
| Course Schedule II | Medium | 55.0% | 66.9% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Diameter of Binary Tree | Easy | 65.1% | 66.9% | TreeDepth-First SearchBinary Tree |
| Binary Tree Cameras | Hard | 47.6% | 55.8% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Find the Winner of the Circular Game | Medium | 82.2% | 55.8% | ArrayMathRecursion+2 |
| First Missing Positive | Hard | 42.5% | 55.8% | ArrayHash Table |
| Top K Frequent Elements | Medium | 65.9% | 55.8% | ArrayHash TableDivide and Conquer+5 |
| Min Cost to Connect All Points | Medium | 70.4% | 55.8% | ArrayUnion-FindGraph Theory+1 |
| Number of Islands | Medium | 63.8% | 55.8% | ArrayDepth-First SearchBreadth-First Search+2 |
| Boundary of Binary Tree | Medium | 47.9% | 55.8% | TreeDepth-First SearchBinary Tree |
| Longest Palindromic Subsequence | Medium | 65.1% | 55.8% | StringDynamic Programming |
| Merge k Sorted Lists | Hard | 58.9% | 55.8% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Surrounded Regions | Medium | 44.8% | 55.8% | ArrayDepth-First SearchBreadth-First Search+2 |
| Clone Graph | Medium | 64.7% | 55.8% | Hash TableDepth-First SearchBreadth-First Search+1 |
| Trapping Rain Water | Hard | 66.8% | 55.8% | ArrayTwo PointersDynamic Programming+2 |
| Set Matrix Zeroes | Medium | 62.5% | 55.8% | ArrayHash TableMatrix |
| Minimum Cost to Make All Characters Equal | Medium | 54.2% | 55.8% | StringDynamic ProgrammingGreedy |
| Pacific Atlantic Water Flow | Medium | 60.6% | 55.8% | ArrayDepth-First SearchBreadth-First Search+1 |
| Jump Game II | Medium | 42.5% | 55.8% | ArrayDynamic ProgrammingGreedy |
| Rotate Array | Medium | 44.5% | 55.8% | ArrayMathTwo Pointers |
| Maximum Employees to Be Invited to a Meeting | Hard | 61.8% | 55.8% | ArrayDynamic ProgrammingDepth-First Search+2 |
| Palindrome Partitioning II | Hard | 36.6% | 55.8% | StringDynamic Programming |
| Snapshot Array | Medium | 36.7% | 55.8% | ArrayHash TableBinary Search+1 |
| Path With Minimum Effort | Medium | 62.8% | 55.8% | ArrayBinary SearchDepth-First Search+4 |
| Split Array Largest Sum | Hard | 59.9% | 55.8% | ArrayBinary SearchDynamic Programming+2 |
| 3Sum | Medium | 38.6% | 55.8% | ArrayTwo PointersSorting |
| Word Ladder II | Hard | 27.5% | 55.8% | Hash TableStringBacktracking+1 |
| Reverse Nodes in Even Length Groups | Medium | 63.7% | 55.8% | Linked List |
| Max Consecutive Ones III | Medium | 67.3% | 55.8% | ArrayBinary SearchSliding Window+1 |
| Meeting Rooms II | Medium | 52.6% | 55.8% | ArrayTwo PointersGreedy+3 |
| Word Break | Medium | 49.1% | 55.8% | ArrayHash TableString+3 |
| Can Place Flowers | Easy | 29.1% | 55.8% | ArrayGreedy |
| LFU Cache | Hard | 48.6% | 55.8% | Hash TableLinked ListDesign+1 |