| Longest Substring Without Repeating Characters | Medium | 38.5% | 100.0% | Hash TableStringSliding Window |
| LRU Cache | Medium | 46.8% | 100.0% | Hash TableLinked ListDesign+1 |
| Valid Parentheses | Easy | 43.7% | 87.5% | StringStack |
| Trapping Rain Water | Hard | 66.8% | 87.5% | ArrayTwo PointersDynamic Programming+2 |
| Lexicographically Smallest String After Operations With Constraint | Medium | 62.9% | 87.5% | StringGreedy |
| Number of Distinct Roll Sequences | Hard | 58.1% | 87.5% | Dynamic ProgrammingMemoization |
| Find Minimum Diameter After Merging Two Trees | Hard | 57.1% | 87.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Container With Most Water | Medium | 59.5% | 75.0% | ArrayTwo PointersGreedy |
| Generate Parentheses | Medium | 78.2% | 75.0% | StringDynamic ProgrammingBacktracking |
| First Missing Positive | Hard | 42.4% | 75.0% | ArrayHash Table |
| Group Anagrams | Medium | 72.2% | 75.0% | ArrayHash TableString+1 |
| Number of Islands | Medium | 63.8% | 75.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Asteroid Collision | Medium | 47.1% | 75.0% | ArrayStackSimulation |
| String Compression | Medium | 59.5% | 75.0% | Two PointersString |
| Pacific Atlantic Water Flow | Medium | 60.6% | 75.0% | ArrayDepth-First SearchBreadth-First Search+1 |
| Longest Repeating Character Replacement | Medium | 59.0% | 75.0% | Hash TableStringSliding Window |
| Two Sum | Easy | 57.1% | 62.5% | ArrayHash Table |
| Median of Two Sorted Arrays | Hard | 45.9% | 62.5% | ArrayBinary SearchDivide and Conquer |
| Zigzag Conversion | Medium | 53.5% | 62.5% | String |
| Merge Intervals | Medium | 51.1% | 62.5% | ArraySorting |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 62.5% | ArrayDynamic Programming |
| Maximum Product Subarray | Medium | 36.0% | 62.5% | ArrayDynamic Programming |
| Largest Number | Medium | 42.6% | 62.5% | ArrayStringGreedy+1 |
| Reverse Linked List | Easy | 80.2% | 62.5% | Linked ListRecursion |
| Kth Largest Element in an Array | Medium | 68.8% | 62.5% | ArrayDivide and ConquerSorting+2 |
| Maximal Square | Medium | 50.0% | 62.5% | ArrayDynamic ProgrammingMatrix |
| Meeting Rooms II | Medium | 52.5% | 62.5% | |
| Move Zeroes | Easy | 63.5% | 62.5% | ArrayTwo Pointers |
| Number of Visible People in a Queue | Hard | 72.3% | 62.5% | ArrayStackMonotonic Stack |
| Coin Change | Medium | 47.9% | 62.5% | ArrayDynamic ProgrammingBreadth-First Search |
| Top K Frequent Words | Medium | 60.0% | 62.5% | ArrayHash TableString+5 |
| Design HashMap | Easy | 66.4% | 62.5% | ArrayHash TableLinked List+2 |
| Rotting Oranges | Medium | 58.1% | 62.5% | ArrayBreadth-First SearchMatrix |
| Reverse Words in a String II | Medium | 56.6% | 62.5% | |
| LFU Cache | Hard | 48.6% | 62.5% | Hash TableLinked ListDesign+1 |
| Set Matrix Zeroes | Medium | 62.4% | 62.5% | ArrayHash TableMatrix |
| Sliding Window Maximum | Hard | 48.4% | 62.5% | ArrayQueueSliding Window+2 |
| Letter Combinations of a Phone Number | Medium | 65.5% | 62.5% | Hash TableStringBacktracking |
| Check if a Parentheses String Can Be Valid | Medium | 45.1% | 62.5% | StringStackGreedy |
| Minimum Number of Swaps to Make the String Balanced | Medium | 78.1% | 62.5% | Two PointersStringStack+1 |
| Jump Game II | Medium | 42.5% | 62.5% | ArrayDynamic ProgrammingGreedy |
| Merge Two Sorted Lists | Easy | 67.9% | 62.5% | Linked ListRecursion |
| Best Time to Buy and Sell Stock II | Medium | 70.7% | 62.5% | ArrayDynamic ProgrammingGreedy |
| Longest Palindromic Substring | Medium | 37.3% | 50.0% | Two PointersStringDynamic Programming |
| Find First and Last Position of Element in Sorted Array | Medium | 48.3% | 50.0% | ArrayBinary Search |
| Permutations | Medium | 81.6% | 50.0% | ArrayBacktracking |
| Maximum Subarray | Medium | 53.0% | 50.0% | ArrayDivide and ConquerDynamic Programming |
| Longest Consecutive Sequence | Medium | 47.0% | 50.0% | ArrayHash TableUnion-Find |
| Vowels of All Substrings | Medium | 55.2% | 50.0% | MathStringDynamic Programming+1 |
| Daily Temperatures | Medium | 68.3% | 50.0% | ArrayStackMonotonic Stack |
| Minimum One Bit Operations to Make Integers Zero | Hard | 78.4% | 50.0% | MathDynamic ProgrammingBit Manipulation+2 |
| Pow(x, n) | Medium | 38.2% | 50.0% | MathRecursion |
| Amount of Time for Binary Tree to Be Infected | Medium | 65.1% | 50.0% | Hash TableTreeDepth-First Search+2 |
| Time Needed to Rearrange a Binary String | Medium | 52.6% | 50.0% | StringDynamic ProgrammingSimulation |
| Binary Tree Right Side View | Medium | 69.5% | 50.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Palindrome Linked List | Easy | 57.4% | 50.0% | Linked ListTwo PointersStack+1 |
| 4Sum | Medium | 40.0% | 50.0% | ArrayTwo PointersSorting |
| Basic Calculator II | Medium | 46.6% | 50.0% | MathStringStack |
| Number of Distinct Islands | Medium | 62.7% | 50.0% | |
| Next Permutation | Medium | 44.7% | 50.0% | ArrayTwo Pointers |
| Gas Station | Medium | 47.5% | 50.0% | ArrayGreedy |
| Find Peak Element | Medium | 46.8% | 50.0% | ArrayBinary Search |
| Target Sum | Medium | 51.8% | 50.0% | ArrayDynamic ProgrammingBacktracking |
| Single Element in a Sorted Array | Medium | 59.2% | 50.0% | ArrayBinary Search |
| Top K Frequent Elements | Medium | 65.8% | 50.0% | ArrayHash TableDivide and Conquer+5 |
| Word Search | Medium | 46.8% | 50.0% | ArrayStringBacktracking+2 |
| Edit Distance | Medium | 60.1% | 50.0% | StringDynamic Programming |
| Subarrays with K Different Integers | Hard | 67.5% | 50.0% | ArrayHash TableSliding Window+1 |
| House Robber II | Medium | 44.6% | 50.0% | ArrayDynamic Programming |
| Maximum Profit From Trading Stocks | Medium | 48.0% | 50.0% | |
| Subarray Sum Equals K | Medium | 46.8% | 50.0% | ArrayHash TablePrefix Sum |
| Next Greater Element II | Medium | 67.9% | 50.0% | ArrayStackMonotonic Stack |
| Word Ladder | Hard | 44.9% | 50.0% | Hash TableStringBreadth-First Search |
| Simplify Path | Medium | 50.0% | 50.0% | StringStack |
| Fruit Into Baskets | Medium | 50.5% | 50.0% | ArrayHash TableSliding Window |
| Longest Common Subsequence | Medium | 58.9% | 50.0% | StringDynamic Programming |
| Combination Sum | Medium | 76.1% | 50.0% | ArrayBacktracking |
| Critical Connections in a Network | Hard | 59.3% | 50.0% | Depth-First SearchGraph TheoryBiconnected Component |