| Maximum Points You Can Obtain from Cards | Medium | 57.3% | 100.0% | ArraySliding WindowPrefix Sum |
| Design Movie Rental System | Hard | 62.6% | 84.3% | ArrayHash TableDesign+2 |
| Minimum Number of Coins to be Added | Medium | 58.0% | 84.3% | ArrayGreedySorting |
| Rotting Oranges | Medium | 58.2% | 82.0% | ArrayBreadth-First SearchMatrix |
| Transform Array to All Equal Elements | Medium | 33.0% | 82.0% | ArrayGreedy |
| Triples with Bitwise AND Equal To Zero | Hard | 60.0% | 82.0% | ArrayHash TableBit Manipulation |
| The Score of Students Solving Math Expression | Hard | 34.0% | 82.0% | ArrayHash TableMath+4 |
| Numbers With Same Consecutive Differences | Medium | 59.1% | 82.0% | BacktrackingBreadth-First Search |
| Minimum Cost to Reach City With Discounts | Medium | 60.2% | 82.0% | Graph TheoryHeap (Priority Queue)Shortest Path |
| Minimum Limit of Balls in a Bag | Medium | 66.5% | 82.0% | ArrayBinary Search |
| Container With Most Water | Medium | 59.6% | 79.5% | ArrayTwo PointersGreedy |
| Trapping Rain Water | Hard | 66.8% | 76.6% | ArrayTwo PointersDynamic Programming+2 |
| Koko Eating Bananas | Medium | 49.7% | 76.6% | ArrayBinary Search |
| Gas Station | Medium | 47.5% | 76.6% | ArrayGreedy |
| Find The Least Frequent Digit | Easy | 69.7% | 76.6% | ArrayHash TableMath+1 |
| Largest Rectangle in Histogram | Hard | 49.4% | 69.7% | ArrayStackMonotonic Stack |
| Two Sum | Easy | 57.1% | 69.7% | ArrayHash Table |
| Search in Rotated Sorted Array | Medium | 44.1% | 65.2% | ArrayBinary Search |
| Pacific Atlantic Water Flow | Medium | 60.6% | 59.9% | ArrayDepth-First SearchBreadth-First Search+1 |
| Cherry Pickup II | Hard | 72.3% | 59.9% | ArrayDynamic ProgrammingMatrix |
| Cut Off Trees for Golf Event | Hard | 36.1% | 59.9% | ArrayBreadth-First SearchHeap (Priority Queue)+1 |
| Reverse Substrings Between Each Pair of Parentheses | Medium | 71.9% | 59.9% | StringStack |
| Next Permutation | Medium | 44.8% | 59.9% | ArrayTwo Pointers |
| Sum of Subarray Minimums | Medium | 38.3% | 59.9% | ArrayDynamic ProgrammingStack+1 |
| Rectangle Area II | Hard | 55.9% | 59.9% | ArraySegment TreeSweep Line+1 |
| Contain Virus | Hard | 54.4% | 59.9% | ArrayDepth-First SearchBreadth-First Search+2 |
| Asteroid Collision | Medium | 47.2% | 59.9% | ArrayStackSimulation |
| Kth Largest Element in an Array | Medium | 68.8% | 59.9% | ArrayDivide and ConquerSorting+2 |
| Create Maximum Number | Hard | 34.7% | 59.9% | ArrayTwo PointersStack+2 |
| Find Median from Data Stream | Hard | 54.2% | 59.9% | Two PointersDesignSorting+2 |
| Unique Paths | Medium | 66.6% | 59.9% | MathDynamic ProgrammingCombinatorics |
| Capacity To Ship Packages Within D Days | Medium | 73.5% | 53.0% | ArrayBinary Search |
| Subarray Sum Equals K | Medium | 46.8% | 53.0% | ArrayHash TablePrefix Sum |
| Maximum Width of Binary Tree | Medium | 45.3% | 53.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Edit Distance | Medium | 60.2% | 53.0% | StringDynamic Programming |
| Candy | Hard | 48.0% | 53.0% | ArrayGreedy |
| Dungeon Game | Hard | 40.9% | 53.0% | ArrayDynamic ProgrammingMatrix |
| Merge Intervals | Medium | 51.2% | 53.0% | ArraySorting |
| Rotate Image | Medium | 79.4% | 53.0% | ArrayMathMatrix |
| Maximum Performance of a Team | Hard | 47.7% | 53.0% | ArrayGreedySorting+1 |
| Next Greater Element I | Easy | 75.8% | 53.0% | ArrayHash TableStack+1 |
| Evaluate Division | Medium | 64.0% | 53.0% | ArrayStringDepth-First Search+4 |
| Generate Parentheses | Medium | 78.3% | 53.0% | StringDynamic ProgrammingBacktracking |
| Cheapest Flights Within K Stops | Medium | 41.4% | 53.0% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+3 |
| Minimum Area Rectangle | Medium | 55.3% | 53.0% | ArrayHash TableMath+2 |
| Critical Connections in a Network | Hard | 59.3% | 53.0% | Depth-First SearchGraph TheoryBiconnected Component |
| Trapping Rain Water II | Hard | 64.0% | 53.0% | ArrayBreadth-First SearchHeap (Priority Queue)+1 |
| Maximal Square | Medium | 50.0% | 53.0% | ArrayDynamic ProgrammingMatrix |
| Sort Colors | Medium | 69.2% | 53.0% | ArrayTwo PointersSorting |
| Amount of Time for Binary Tree to Be Infected | Medium | 65.1% | 53.0% | Hash TableTreeDepth-First Search+2 |
| Merge k Sorted Lists | Hard | 58.9% | 53.0% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| 3Sum | Medium | 38.6% | 53.0% | ArrayTwo PointersSorting |
| Next Greater Element II | Medium | 67.9% | 53.0% | ArrayStackMonotonic Stack |
| Course Schedule | Medium | 50.8% | 53.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 43.3% | Hash TableStringSliding Window |
| First Missing Positive | Hard | 42.5% | 43.3% | ArrayHash Table |
| Number of Islands | Medium | 63.8% | 43.3% | ArrayDepth-First SearchBreadth-First Search+2 |
| Product of Array Except Self | Medium | 68.6% | 43.3% | ArrayPrefix Sum |
| Partition Equal Subset Sum | Medium | 49.2% | 43.3% | ArrayDynamic Programming |
| 01 Matrix | Medium | 53.4% | 43.3% | ArrayDynamic ProgrammingBreadth-First Search+1 |
| Shortest Bridge | Medium | 59.3% | 43.3% | ArrayDepth-First SearchBreadth-First Search+1 |
| Median of Two Sorted Arrays | Hard | 46.0% | 43.3% | ArrayBinary SearchDivide and Conquer |
| Cherry Pickup | Hard | 39.1% | 43.3% | ArrayDynamic ProgrammingMatrix |
| Maximal Rectangle | Hard | 58.1% | 43.3% | ArrayDynamic ProgrammingStack+2 |
| House Robber | Medium | 52.9% | 43.3% | ArrayDynamic Programming |
| Minimum Number of Days to Make m Bouquets | Medium | 56.3% | 43.3% | ArrayBinary Search |
| Filling Bookcase Shelves | Medium | 68.6% | 43.3% | ArrayDynamic Programming |
| Path Sum II | Medium | 61.8% | 43.3% | BacktrackingTreeDepth-First Search+1 |
| Reconstruct Itinerary | Hard | 44.3% | 43.3% | ArrayStringDepth-First Search+4 |
| Find Minimum in Rotated Sorted Array | Medium | 53.8% | 43.3% | ArrayBinary Search |
| Delete Node in a BST | Medium | 54.2% | 43.3% | TreeBinary Search TreeBinary Tree |
| Ways to Split Array Into Good Subarrays | Medium | 34.8% | 43.3% | ArrayMathDynamic Programming |
| All Nodes Distance K in Binary Tree | Medium | 67.4% | 43.3% | Hash TableTreeDepth-First Search+2 |
| 3Sum Closest | Medium | 48.1% | 43.3% | ArrayTwo PointersSorting |
| Find K Pairs with Smallest Sums | Medium | 41.6% | 43.3% | ArrayHeap (Priority Queue) |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 43.3% | StringTreeDepth-First Search+3 |
| Magnetic Force Between Two Balls | Medium | 71.9% | 43.3% | ArrayBinary SearchSorting |
| Course Schedule II | Medium | 55.0% | 43.3% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Maximum Frequency Stack | Hard | 66.6% | 43.3% | Hash TableStackDesign+1 |
| Word Ladder | Hard | 44.9% | 43.3% | Hash TableStringBreadth-First Search |
| Valid Parentheses | Easy | 43.7% | 43.3% | StringStack |
| Robot Collisions | Hard | 56.1% | 43.3% | ArrayStackSorting+1 |
| Find Leaves of Binary Tree | Medium | 81.3% | 43.3% | TreeDepth-First SearchBinary Tree |
| Find K Closest Elements | Medium | 49.4% | 43.3% | ArrayTwo PointersBinary Search+3 |
| Sort Characters By Frequency | Medium | 75.1% | 43.3% | Hash TableStringSorting+3 |
| Boats to Save People | Medium | 61.4% | 43.3% | ArrayTwo PointersGreedy+1 |
| Smallest Range Covering Elements from K Lists | Hard | 70.1% | 43.3% | ArrayHash TableGreedy+3 |
| Single Element in a Sorted Array | Medium | 59.2% | 43.3% | ArrayBinary Search |
| Number of Atoms | Hard | 65.1% | 43.3% | Hash TableStringStack+1 |
| Find the Duplicate Number | Medium | 64.0% | 43.3% | ArrayTwo PointersBinary Search+1 |
| LRU Cache | Medium | 46.8% | 43.3% | Hash TableLinked ListDesign+1 |
| Online Election | Medium | 52.7% | 43.3% | ArrayHash TableBinary Search+1 |
| Min Cost to Connect All Points | Medium | 70.4% | 43.3% | ArrayUnion-FindGraph Theory+1 |
| Min Stack | Medium | 57.7% | 43.3% | StackDesign |
| Decode Ways | Medium | 37.6% | 43.3% | StringDynamic Programming |
| Map Sum Pairs | Medium | 57.1% | 43.3% | Hash TableStringDesign+1 |
| Car Pooling | Medium | 56.2% | 43.3% | ArraySortingHeap (Priority Queue)+2 |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 43.3% | ArrayDynamic Programming |
| Diameter of Binary Tree | Easy | 65.1% | 43.3% | TreeDepth-First SearchBinary Tree |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 43.3% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Longest Palindromic Substring | Medium | 37.4% | 43.3% | Two PointersStringDynamic Programming |
| Spiral Matrix | Medium | 56.2% | 43.3% | ArrayMatrixSimulation |
| Subsets | Medium | 82.1% | 43.3% | ArrayBacktrackingBit Manipulation |
| Majority Element | Easy | 66.1% | 43.3% | ArrayHash TableDivide and Conquer+2 |
| Split Array Largest Sum | Hard | 59.9% | 43.3% | ArrayBinary SearchDynamic Programming+2 |