| Rank Teams by Votes | Medium | 60.0% | 100.0% | ArrayHash TableString+2 |
| Stock Price Fluctuation | Medium | 48.9% | 94.9% | Hash TableDesignHeap (Priority Queue)+2 |
| All O`one Data Structure | Hard | 44.2% | 91.9% | Hash TableLinked ListDesign+1 |
| Design Snake Game | Medium | 40.0% | 88.4% | ArrayHash TableDesign+2 |
| Merge Intervals | Medium | 51.2% | 82.8% | ArraySorting |
| High-Access Employees | Medium | 47.3% | 75.7% | ArrayHash TableString+1 |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.8% | 73.7% | TreeDepth-First SearchBinary Tree |
| Meeting Rooms II | Medium | 52.6% | 70.3% | ArrayTwo PointersGreedy+3 |
| Word Search | Medium | 46.9% | 64.4% | ArrayStringBacktracking+2 |
| Find the Width of Columns of a Grid | Easy | 70.4% | 64.4% | ArrayMatrix |
| Number of Possible Sets of Closing Branches | Hard | 50.7% | 64.4% | Bit ManipulationGraph TheoryHeap (Priority Queue)+2 |
| Text Justification | Hard | 50.5% | 62.6% | ArrayStringSimulation |
| Maximum Square Area by Removing Fences From a Field | Medium | 49.4% | 62.6% | ArrayHash TableEnumeration |
| Maximum Area of Longest Diagonal Rectangle | Easy | 45.9% | 62.6% | Array |
| Maximum Good Subarray Sum | Medium | 21.4% | 62.6% | ArrayHash TablePrefix Sum |
| Minimum Cost to Convert String I | Medium | 63.2% | 62.6% | ArrayStringGraph Theory+1 |
| Smallest Missing Non-negative Integer After Operations | Medium | 55.9% | 62.6% | ArrayHash TableMath+1 |
| Minimum Cost to Convert String II | Hard | 59.7% | 62.6% | ArrayStringDynamic Programming+3 |
| Make Lexicographically Smallest Array by Swapping Elements | Medium | 60.2% | 62.6% | ArrayUnion-FindSorting |
| Verbal Arithmetic Puzzle | Hard | 34.9% | 62.6% | ArrayMathString+1 |
| Minimum Time to Visit a Cell In a Grid | Hard | 56.3% | 62.6% | ArrayBreadth-First SearchGraph Theory+3 |
| Lowest Common Ancestor of a Binary Tree IV | Medium | 79.5% | 60.6% | Hash TableTreeDepth-First Search+1 |
| The Time When the Network Becomes Idle | Medium | 55.3% | 55.8% | ArrayBreadth-First SearchGraph Theory |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 52.9% | ArrayDynamic Programming |
| Top K Frequent Elements | Medium | 65.9% | 52.9% | ArrayHash TableDivide and Conquer+5 |
| Logger Rate Limiter | Easy | 76.8% | 52.9% | Hash TableDesignData Stream |
| Group Anagrams | Medium | 72.2% | 49.5% | ArrayHash TableString+1 |
| Can Place Flowers | Easy | 29.1% | 49.5% | ArrayGreedy |
| Koko Eating Bananas | Medium | 49.7% | 45.3% | ArrayBinary Search |
| Russian Doll Envelopes | Hard | 37.7% | 45.3% | ArrayBinary SearchDynamic Programming+1 |
| Longest String Chain | Medium | 62.8% | 45.3% | ArrayHash TableTwo Pointers+3 |
| Longest Consecutive Sequence | Medium | 47.0% | 45.3% | ArrayHash TableUnion-Find |
| Two Sum | Easy | 57.1% | 39.9% | ArrayHash Table |
| Pairs of Songs With Total Durations Divisible by 60 | Medium | 53.4% | 39.9% | ArrayHash TableCounting |
| Jump Game II | Medium | 42.5% | 39.9% | ArrayDynamic ProgrammingGreedy |
| Rearranging Fruits | Hard | 57.5% | 39.9% | ArrayHash TableGreedy+1 |
| Nth Highest Salary | Medium | 38.8% | 39.9% | Database |
| Last Day Where You Can Still Cross | Hard | 68.6% | 39.9% | ArrayBinary SearchDepth-First Search+3 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 39.9% | Hash TableStringSliding Window |
| Maximum Subarray | Medium | 53.0% | 39.9% | ArrayDivide and ConquerDynamic Programming |
| Design Authentication Manager | Medium | 58.4% | 39.9% | Hash TableLinked ListDesign+1 |
| Maximum Score with Co-Prime Element | Hard | | 32.4% | ArrayHash TableMath+3 |
| Design File System | Medium | 65.1% | 32.4% | Hash TableStringDesign+1 |
| Longest Increasing Subsequence | Medium | 59.1% | 32.4% | ArrayBinary SearchDynamic Programming |
| Boats to Save People | Medium | 61.4% | 32.4% | ArrayTwo PointersGreedy+1 |
| Design Hit Counter | Medium | 69.6% | 32.4% | ArrayBinary SearchDesign+2 |
| Find K Closest Elements | Medium | 49.4% | 32.4% | ArrayTwo PointersBinary Search+3 |
| Find First and Last Position of Element in Sorted Array | Medium | 48.4% | 32.4% | ArrayBinary Search |
| Design Add and Search Words Data Structure | Medium | 48.2% | 32.4% | StringDepth-First SearchDesign+1 |
| Count Vowel Strings in Ranges | Medium | 67.8% | 32.4% | ArrayStringPrefix Sum |
| Lowest Common Ancestor of a Binary Tree III | Medium | 82.9% | 32.4% | Hash TableTwo PointersTree+1 |
| Wildcard Matching | Hard | 31.4% | 32.4% | StringDynamic ProgrammingGreedy+1 |
| Design a Food Rating System | Medium | 52.9% | 32.4% | ArrayHash TableString+3 |
| LRU Cache | Medium | 46.8% | 32.4% | Hash TableLinked ListDesign+1 |
| Count Palindromic Subsequences | Hard | 41.0% | 32.4% | StringDynamic Programming |
| Lowest Common Ancestor of a Binary Tree II | Medium | 69.5% | 32.4% | TreeDepth-First SearchBinary Tree |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 32.4% | StringTreeDepth-First Search+3 |
| Next Permutation | Medium | 44.8% | 32.4% | ArrayTwo Pointers |
| Number of Perfect Pairs | Medium | 33.4% | 32.4% | ArrayMathTwo Pointers+1 |
| Maximum Xor Product | Medium | 29.6% | 32.4% | MathGreedyBit Manipulation |
| Tallest Billboard | Hard | 51.8% | 32.4% | ArrayDynamic Programming |
| Best Time to Buy and Sell Stock II | Medium | 70.8% | 32.4% | ArrayDynamic ProgrammingGreedy |