| Best Time to Buy and Sell Stock | Easy | 56.4% | 100.0% | ArrayDynamic Programming |
| Best Team With No Conflicts | Medium | 50.6% | 96.1% | ArrayDynamic ProgrammingSorting |
| Minimum Number of Lines to Cover Points | Medium | 43.9% | 91.6% | ArrayHash TableMath+5 |
| Find the Longest Valid Obstacle Course at Each Position | Hard | 62.6% | 91.6% | ArrayBinary SearchBinary Indexed Tree |
| Minimum Cost to Move Chips to The Same Position | Easy | 72.8% | 91.6% | ArrayMathGreedy |
| Find Subarrays With Equal Sum | Easy | 66.9% | 91.6% | ArrayHash Table |
| The Employee That Worked on the Longest Task | Easy | 51.4% | 91.6% | Array |
| Find The Original Array of Prefix Xor | Medium | 88.3% | 91.6% | ArrayBit Manipulation |
| Two Sum | Easy | 57.1% | 86.0% | ArrayHash Table |
| Delete and Earn | Medium | 57.1% | 78.8% | ArrayHash TableDynamic Programming |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 78.8% | Hash TableStringSliding Window |
| Count Subarrays With Fixed Bounds | Hard | 69.2% | 78.8% | ArrayQueueSliding Window+1 |
| Merge Intervals | Medium | 51.2% | 68.6% | ArraySorting |
| First Unique Character in a String | Easy | 65.1% | 68.6% | Hash TableStringQueue+1 |
| LRU Cache | Medium | 46.8% | 68.6% | Hash TableLinked ListDesign+1 |
| Palindrome Number | Easy | 60.3% | 68.6% | Math |
| Remove Nth Node From End of List | Medium | 51.0% | 61.5% | Linked ListTwo Pointers |
| Kth Largest Element in an Array | Medium | 68.8% | 61.5% | ArrayDivide and ConquerSorting+2 |
| Copy List with Random Pointer | Medium | 62.4% | 61.5% | Hash TableLinked List |
| Group Anagrams | Medium | 72.2% | 61.5% | ArrayHash TableString+1 |
| Stamping The Sequence | Hard | 62.2% | 61.5% | StringStackGreedy+1 |
| Make K-Subarray Sums Equal | Medium | 38.2% | 61.5% | ArrayMathGreedy+2 |
| Sort Colors | Medium | 69.2% | 61.5% | ArrayTwo PointersSorting |
| Remove Duplicates from Sorted Array | Easy | 62.3% | 61.5% | ArrayTwo Pointers |
| Jump Game | Medium | 40.5% | 61.5% | ArrayDynamic ProgrammingGreedy |
| Spiral Matrix | Medium | 56.2% | 61.5% | ArrayMatrixSimulation |
| Daily Temperatures | Medium | 68.4% | 61.5% | ArrayStackMonotonic Stack |
| Shuffle the Array | Easy | 89.0% | 51.4% | Array |
| Reorder List | Medium | 64.6% | 51.4% | Linked ListTwo PointersStack+1 |
| Next Greater Element I | Easy | 75.8% | 51.4% | ArrayHash TableStack+1 |
| Meeting Rooms II | Medium | 52.6% | 51.4% | ArrayTwo PointersGreedy+3 |
| Contiguous Array | Medium | 50.8% | 51.4% | ArrayHash TablePrefix Sum |
| Generate Parentheses | Medium | 78.3% | 51.4% | StringDynamic ProgrammingBacktracking |
| 3Sum | Medium | 38.6% | 51.4% | ArrayTwo PointersSorting |
| Subarrays with K Different Integers | Hard | 67.6% | 51.4% | ArrayHash TableSliding Window+1 |
| Kth Missing Positive Number | Easy | 63.2% | 51.4% | ArrayBinary Search |
| Coin Change II | Medium | 60.4% | 51.4% | ArrayDynamic Programming |
| Minimum Number of Taps to Open to Water a Garden | Hard | 51.0% | 51.4% | ArrayDynamic ProgrammingGreedy |
| Candy | Hard | 48.0% | 51.4% | ArrayGreedy |
| Word Search | Medium | 46.9% | 51.4% | ArrayStringBacktracking+2 |
| Next Greater Element III | Medium | 35.2% | 51.4% | MathTwo PointersString |
| Minimum Operations to Reduce X to Zero | Medium | 40.4% | 51.4% | ArrayHash TableBinary Search+2 |
| Remove All Adjacent Duplicates in String II | Medium | 60.9% | 51.4% | StringStack |
| Longest Common Subsequence | Medium | 58.9% | 51.4% | StringDynamic Programming |
| Minimum Substring Partition of Equal Character Frequency | Medium | 40.0% | 51.4% | Hash TableStringDynamic Programming+1 |
| Palindrome Linked List | Easy | 57.5% | 51.4% | Linked ListTwo PointersStack+1 |
| Minimum Suffix Flips | Medium | 73.9% | 51.4% | StringGreedy |
| Next Greater Element II | Medium | 67.9% | 51.4% | ArrayStackMonotonic Stack |
| Sum of Subarray Minimums | Medium | 38.3% | 51.4% | ArrayDynamic ProgrammingStack+1 |
| Least Number of Unique Integers after K Removals | Medium | 63.7% | 51.4% | ArrayHash TableGreedy+2 |
| Longest Palindromic Substring | Medium | 37.4% | 51.4% | Two PointersStringDynamic Programming |
| Maximum Subarray | Medium | 53.0% | 51.4% | ArrayDivide and ConquerDynamic Programming |
| Majority Element | Easy | 66.1% | 51.4% | ArrayHash TableDivide and Conquer+2 |
| Maximum Product Subarray | Medium | 36.0% | 51.4% | ArrayDynamic Programming |
| Longest Increasing Subsequence | Medium | 59.1% | 51.4% | ArrayBinary SearchDynamic Programming |
| Coin Change | Medium | 48.0% | 51.4% | ArrayDynamic ProgrammingBreadth-First Search |
| Longest Consecutive Sequence | Medium | 47.0% | 51.4% | ArrayHash TableUnion-Find |
| Container With Most Water | Medium | 59.6% | 51.4% | ArrayTwo PointersGreedy |
| Top K Frequent Elements | Medium | 65.9% | 51.4% | ArrayHash TableDivide and Conquer+5 |
| Count of Range Sum | Hard | 38.3% | 51.4% | ArrayBinary SearchDivide and Conquer+4 |