| LRU Cache | Medium | 46.8% | 100.0% | Hash TableLinked ListDesign+1 |
| Two Sum | Easy | 57.1% | 87.5% | ArrayHash Table |
| Merge Intervals | Medium | 51.1% | 87.5% | ArraySorting |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 87.5% | ArrayDynamic Programming |
| Number of Islands | Medium | 63.8% | 87.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 75.0% | Hash TableStringSliding Window |
| Reverse Integer | Medium | 31.5% | 75.0% | Math |
| Longest Common Prefix | Easy | 47.1% | 75.0% | ArrayStringTrie |
| Valid Parentheses | Easy | 43.7% | 75.0% | StringStack |
| Merge k Sorted Lists | Hard | 58.8% | 75.0% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Valid Sudoku | Medium | 64.1% | 75.0% | ArrayHash TableMatrix |
| Trapping Rain Water | Hard | 66.8% | 75.0% | ArrayTwo PointersDynamic Programming+2 |
| Rotate Image | Medium | 79.3% | 75.0% | ArrayMathMatrix |
| Group Anagrams | Medium | 72.2% | 75.0% | ArrayHash TableString+1 |
| Maximum Subarray | Medium | 53.0% | 75.0% | ArrayDivide and ConquerDynamic Programming |
| Spiral Matrix | Medium | 56.1% | 75.0% | ArrayMatrixSimulation |
| Valid Palindrome | Easy | 52.8% | 75.0% | Two PointersString |
| Reverse Words in a String | Medium | 55.5% | 75.0% | Two PointersString |
| Rotate Array | Medium | 44.4% | 75.0% | ArrayMathTwo Pointers |
| Reverse Linked List | Easy | 80.2% | 75.0% | Linked ListRecursion |
| Course Schedule | Medium | 50.8% | 75.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Kth Largest Element in an Array | Medium | 68.8% | 75.0% | ArrayDivide and ConquerSorting+2 |
| Product of Array Except Self | Medium | 68.6% | 75.0% | ArrayPrefix Sum |
| Top K Frequent Elements | Medium | 65.8% | 75.0% | ArrayHash TableDivide and Conquer+5 |
| Design Hit Counter | Medium | 69.6% | 75.0% | |
| Median of Two Sorted Arrays | Hard | 45.9% | 62.5% | ArrayBinary SearchDivide and Conquer |
| Longest Palindromic Substring | Medium | 37.3% | 62.5% | Two PointersStringDynamic Programming |
| Merge Two Sorted Lists | Easy | 67.9% | 62.5% | Linked ListRecursion |
| Remove Duplicates from Sorted Array | Easy | 62.2% | 62.5% | ArrayTwo Pointers |
| Find the Index of the First Occurrence in a String | Easy | 46.2% | 62.5% | Two PointersStringString Matching |
| Find First and Last Position of Element in Sorted Array | Medium | 48.3% | 62.5% | ArrayBinary Search |
| Sqrt(x) | Easy | 41.4% | 62.5% | MathBinary Search |
| Climbing Stairs | Easy | 53.9% | 62.5% | MathDynamic ProgrammingMemoization |
| Merge Sorted Array | Easy | 54.4% | 62.5% | ArrayTwo PointersSorting |
| Binary Tree Level Order Traversal | Medium | 72.2% | 62.5% | TreeBreadth-First SearchBinary Tree |
| Pascal's Triangle | Easy | 78.7% | 62.5% | ArrayDynamic Programming |
| Best Time to Buy and Sell Stock II | Medium | 70.7% | 62.5% | ArrayDynamic ProgrammingGreedy |
| Word Ladder | Hard | 44.9% | 62.5% | Hash TableStringBreadth-First Search |
| Word Break | Medium | 49.1% | 62.5% | ArrayHash TableString+3 |
| Max Points on a Line | Hard | 30.2% | 62.5% | ArrayHash TableMath+1 |
| Min Stack | Medium | 57.7% | 62.5% | StackDesign |
| Compare Version Numbers | Medium | 46.1% | 62.5% | Two PointersString |
| Reverse Bits | Easy | 67.7% | 62.5% | Divide and ConquerBit Manipulation |
| Number of 1 Bits | Easy | 76.3% | 62.5% | Divide and ConquerBit Manipulation |
| Course Schedule II | Medium | 55.0% | 62.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.7% | 62.5% | TreeDepth-First SearchBinary Tree |
| Search a 2D Matrix II | Medium | 56.8% | 62.5% | ArrayBinary SearchDivide and Conquer+1 |
| Valid Anagram | Easy | 67.8% | 62.5% | Hash TableStringSorting |
| Meeting Rooms II | Medium | 52.5% | 62.5% | |
| Move Zeroes | Easy | 63.5% | 62.5% | ArrayTwo Pointers |
| Peeking Iterator | Medium | 61.2% | 62.5% | ArrayDesignIterator |
| Find Median from Data Stream | Hard | 54.2% | 62.5% | Two PointersDesignSorting+2 |
| Design Tic-Tac-Toe | Medium | 58.7% | 62.5% | |
| Ransom Note | Easy | 65.6% | 62.5% | Hash TableStringCounting |
| String Compression | Medium | 59.5% | 62.5% | Two PointersString |
| Subarray Sum Equals K | Medium | 46.8% | 62.5% | ArrayHash TablePrefix Sum |
| Subarray Product Less Than K | Medium | 53.9% | 62.5% | ArrayBinary SearchSliding Window+1 |
| Design HashMap | Easy | 66.4% | 62.5% | ArrayHash TableLinked List+2 |
| Design Circular Queue | Medium | 54.0% | 62.5% | ArrayLinked ListDesign+1 |
| Time Based Key-Value Store | Medium | 49.7% | 62.5% | Hash TableStringBinary Search+1 |
| Snapshot Array | Medium | 36.7% | 62.5% | ArrayHash TableBinary Search+1 |
| Add Two Numbers | Medium | 47.9% | 50.0% | Linked ListMathRecursion |
| Regular Expression Matching | Hard | 30.4% | 50.0% | StringDynamic ProgrammingRecursion |
| Container With Most Water | Medium | 59.5% | 50.0% | ArrayTwo PointersGreedy |
| 3Sum | Medium | 38.6% | 50.0% | ArrayTwo PointersSorting |
| Letter Combinations of a Phone Number | Medium | 65.5% | 50.0% | Hash TableStringBacktracking |
| Remove Nth Node From End of List | Medium | 51.0% | 50.0% | Linked ListTwo Pointers |
| Generate Parentheses | Medium | 78.2% | 50.0% | StringDynamic ProgrammingBacktracking |
| Search in Rotated Sorted Array | Medium | 44.1% | 50.0% | ArrayBinary Search |
| Permutations | Medium | 81.6% | 50.0% | ArrayBacktracking |
| Jump Game | Medium | 40.5% | 50.0% | ArrayDynamic ProgrammingGreedy |
| Insert Interval | Medium | 44.7% | 50.0% | Array |
| Set Matrix Zeroes | Medium | 62.4% | 50.0% | ArrayHash TableMatrix |
| Word Search | Medium | 46.8% | 50.0% | ArrayStringBacktracking+2 |
| Reverse Linked List II | Medium | 51.0% | 50.0% | Linked List |
| Maximum Depth of Binary Tree | Easy | 77.9% | 50.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Longest Consecutive Sequence | Medium | 47.0% | 50.0% | ArrayHash TableUnion-Find |
| Two Sum II - Input Array Is Sorted | Medium | 64.6% | 50.0% | ArrayTwo PointersBinary Search |
| Happy Number | Easy | 59.2% | 50.0% | Hash TableMathTwo Pointers |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 50.0% | Hash TableStringDesign+1 |
| Maximal Square | Medium | 50.0% | 50.0% | ArrayDynamic ProgrammingMatrix |
| Basic Calculator II | Medium | 46.6% | 50.0% | MathStringStack |
| Implement Queue using Stacks | Easy | 69.3% | 50.0% | StackDesignQueue |
| Delete Node in a Linked List | Medium | 83.6% | 50.0% | Linked List |
| Binary Tree Paths | Easy | 68.2% | 50.0% | StringBacktrackingTree+2 |
| Integer to English Words | Hard | 34.8% | 50.0% | MathStringRecursion |
| Serialize and Deserialize Binary Tree | Hard | 60.3% | 50.0% | StringTreeDepth-First Search+3 |
| Flatten Nested List Iterator | Medium | 65.6% | 50.0% | StackTreeDepth-First Search+3 |
| Reverse String | Easy | 80.5% | 50.0% | Two PointersString |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 50.0% | ArrayHash TableMath+2 |
| First Unique Character in a String | Easy | 65.0% | 50.0% | Hash TableStringQueue+1 |
| Decode String | Medium | 62.2% | 50.0% | StringStackRecursion |
| Array Nesting | Medium | 56.5% | 50.0% | ArrayDepth-First Search |
| Task Scheduler | Medium | 62.6% | 50.0% | ArrayHash TableGreedy+3 |
| Find K Closest Elements | Medium | 49.4% | 50.0% | ArrayTwo PointersBinary Search+3 |
| Best Time to Buy and Sell Stock with Transaction Fee | Medium | 71.7% | 50.0% | ArrayDynamic ProgrammingGreedy |
| Flood Fill | Easy | 67.8% | 50.0% | ArrayDepth-First SearchBreadth-First Search+1 |
| Middle of the Linked List | Easy | 81.5% | 50.0% | Linked ListTwo Pointers |
| Random Pick with Weight | Medium | 48.9% | 50.0% | ArrayMathBinary Search+2 |
| Fibonacci Number | Easy | 73.9% | 50.0% | MathDynamic ProgrammingRecursion+1 |
| Number of Squareful Arrays | Hard | 51.2% | 50.0% | ArrayHash TableMath+4 |
| Remove All Adjacent Duplicates In String | Easy | 72.8% | 50.0% | StringStack |
| Find Winner on a Tic Tac Toe Game | Easy | 54.5% | 50.0% | ArrayHash TableMatrix+1 |
| Number of Pairs of Strings With Concatenation Equal to Target | Medium | 75.4% | 50.0% | ArrayHash TableString+1 |
| Maximum Rows Covered by Columns | Medium | 57.7% | 50.0% | ArrayBacktrackingBit Manipulation+2 |
| Count the Number of Incremovable Subarrays II | Hard | 40.1% | 50.0% | ArrayTwo PointersBinary Search |
| Count the Number of Incremovable Subarrays I | Easy | 56.2% | 50.0% | ArrayTwo PointersBinary Search+1 |
| Find the Grid of Region Average | Medium | 43.2% | 50.0% | ArrayMatrix |
| Calculate Score After Performing Instructions | Medium | 56.9% | 50.0% | ArrayHash TableString+1 |
| Find Servers That Handled Most Number of Requests | Hard | 45.2% | 50.0% | ArrayHeap (Priority Queue)Simulation+1 |
| Zigzag Conversion | Medium | 53.5% | 37.5% | String |
| String to Integer (atoi) | Medium | 20.6% | 37.5% | String |
| Roman to Integer | Easy | 66.2% | 37.5% | Hash TableMathString |
| 4Sum | Medium | 40.0% | 37.5% | ArrayTwo PointersSorting |
| Search Insert Position | Easy | 50.7% | 37.5% | ArrayBinary Search |
| Combination Sum | Medium | 76.1% | 37.5% | ArrayBacktracking |
| First Missing Positive | Hard | 42.4% | 37.5% | ArrayHash Table |
| Wildcard Matching | Hard | 31.3% | 37.5% | StringDynamic ProgrammingGreedy+1 |
| Permutations II | Medium | 62.9% | 37.5% | ArrayBacktrackingSorting |
| Add Binary | Easy | 57.6% | 37.5% | MathStringBit Manipulation+1 |
| Text Justification | Hard | 50.4% | 37.5% | ArrayStringSimulation |
| Simplify Path | Medium | 50.0% | 37.5% | StringStack |
| Search a 2D Matrix | Medium | 53.5% | 37.5% | ArrayBinary SearchMatrix |
| Sort Colors | Medium | 69.1% | 37.5% | ArrayTwo PointersSorting |
| Interleaving String | Medium | 43.5% | 37.5% | StringDynamic Programming |
| Validate Binary Search Tree | Medium | 35.3% | 37.5% | TreeDepth-First SearchBinary Search Tree+1 |
| Symmetric Tree | Easy | 60.7% | 37.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 37.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Gas Station | Medium | 47.5% | 37.5% | ArrayGreedy |
| Reorder List | Medium | 64.6% | 37.5% | Linked ListTwo PointersStack+1 |
| Find Minimum in Rotated Sorted Array | Medium | 53.8% | 37.5% | ArrayBinary Search |
| Find Peak Element | Medium | 46.8% | 37.5% | ArrayBinary Search |
| Majority Element | Easy | 66.1% | 37.5% | ArrayHash TableDivide and Conquer+2 |
| Best Time to Buy and Sell Stock IV | Hard | 49.5% | 37.5% | ArrayDynamic Programming |
| House Robber | Medium | 52.9% | 37.5% | ArrayDynamic Programming |
| House Robber II | Medium | 44.6% | 37.5% | ArrayDynamic Programming |
| Contains Duplicate | Easy | 64.1% | 37.5% | ArrayHash TableSorting |
| The Skyline Problem | Hard | 45.0% | 37.5% | ArrayDivide and ConquerBinary Indexed Tree+5 |
| Sliding Window Maximum | Hard | 48.4% | 37.5% | ArrayQueueSliding Window+2 |
| Meeting Rooms | Easy | 59.3% | 37.5% | |
| Missing Number | Easy | 71.6% | 37.5% | ArrayHash TableMath+3 |
| H-Index | Medium | 41.1% | 37.5% | ArraySortingCounting Sort |
| Coin Change | Medium | 47.9% | 37.5% | ArrayDynamic ProgrammingBreadth-First Search |
| Intersection of Two Arrays | Easy | 77.5% | 37.5% | ArrayHash TableTwo Pointers+2 |
| Kth Smallest Element in a Sorted Matrix | Medium | 64.4% | 37.5% | ArrayBinary SearchSorting+2 |
| Fizz Buzz | Easy | 75.2% | 37.5% | MathStringSimulation |
| Find All Anagrams in a String | Medium | 53.3% | 37.5% | Hash TableStringSliding Window |
| LFU Cache | Hard | 48.6% | 37.5% | Hash TableLinked ListDesign+1 |
| Validate IP Address | Medium | 28.2% | 37.5% | String |
| Next Greater Element II | Medium | 67.9% | 37.5% | ArrayStackMonotonic Stack |
| Diameter of Binary Tree | Easy | 65.0% | 37.5% | TreeDepth-First SearchBinary Tree |
| Maximum Product of Three Numbers | Easy | 45.7% | 37.5% | ArrayMathSorting |
| Valid Palindrome II | Easy | 44.0% | 37.5% | Two PointersStringGreedy |
| Asteroid Collision | Medium | 47.1% | 37.5% | ArrayStackSimulation |
| Binary Search | Easy | 60.5% | 37.5% | ArrayBinary Search |
| Cheapest Flights Within K Stops | Medium | 41.4% | 37.5% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+3 |
| Snakes and Ladders | Medium | 48.0% | 37.5% | ArrayBreadth-First SearchMatrix |
| Verifying an Alien Dictionary | Easy | 55.9% | 37.5% | ArrayHash TableString |
| K Closest Points to Origin | Medium | 68.7% | 37.5% | ArrayMathDivide and Conquer+4 |
| Rotting Oranges | Medium | 58.1% | 37.5% | ArrayBreadth-First SearchMatrix |
| Minimum Remove to Make Valid Parentheses | Medium | 71.3% | 37.5% | StringStack |
| Dot Product of Two Sparse Vectors | Medium | 89.9% | 37.5% | |
| Create Hello World Function | Easy | 82.0% | 37.5% | |
| Apple Redistribution into Boxes | Easy | 78.4% | 37.5% | ArrayGreedySorting |
| Lowest Common Ancestor of a Binary Tree III | Medium | 82.9% | 37.5% | |
| Maximum Frequency Stack | Hard | 66.6% | 37.5% | Hash TableStackDesign+1 |
| Exam Room | Medium | 43.2% | 37.5% | DesignHeap (Priority Queue)Ordered Set |
| Distribute Money to Maximum Children | Easy | 20.4% | 37.5% | MathGreedy |
| Alien Dictionary | Hard | 37.1% | 37.5% | |
| Design Browser History | Medium | 78.2% | 37.5% | ArrayLinked ListStack+3 |
| Design Add and Search Words Data Structure | Medium | 48.1% | 37.5% | StringDepth-First SearchDesign+1 |
| Path Sum | Easy | 54.4% | 37.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Maximum Path Quality of a Graph | Hard | 61.6% | 37.5% | ArrayBacktrackingGraph Theory |
| Convert Sorted Array to Binary Search Tree | Easy | 75.2% | 37.5% | ArrayDivide and ConquerTree+2 |
| Find the Celebrity | Medium | 48.9% | 37.5% | |
| Palindrome Number | Easy | 60.2% | 25.0% | Math |
| Reverse Nodes in k-Group | Hard | 65.3% | 25.0% | Linked ListRecursion |
| Remove Element | Easy | 61.3% | 25.0% | ArrayTwo Pointers |
| Divide Two Integers | Medium | 19.4% | 25.0% | MathBit Manipulation |
| Jump Game II | Medium | 42.4% | 25.0% | ArrayDynamic ProgrammingGreedy |
| N-Queens | Hard | 74.9% | 25.0% | ArrayBacktracking |
| Length of Last Word | Easy | 58.3% | 25.0% | String |
| Rotate List | Medium | 41.2% | 25.0% | Linked ListTwo Pointers |
| Edit Distance | Medium | 60.1% | 25.0% | StringDynamic Programming |
| Minimum Window Substring | Hard | 46.9% | 25.0% | Hash TableStringSliding Window |
| Largest Rectangle in Histogram | Hard | 49.3% | 25.0% | ArrayStackMonotonic Stack |
| Maximal Rectangle | Hard | 58.1% | 25.0% | ArrayDynamic ProgrammingStack+2 |
| Subsets II | Medium | 60.9% | 25.0% | ArrayBacktrackingBit Manipulation |
| Decode Ways | Medium | 37.6% | 25.0% | StringDynamic Programming |
| Same Tree | Easy | 66.6% | 25.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Balanced Binary Tree | Easy | 57.8% | 25.0% | TreeDepth-First SearchBinary Tree |
| Triangle | Medium | 59.8% | 25.0% | ArrayDynamic Programming |
| Best Time to Buy and Sell Stock III | Hard | 53.1% | 25.0% | ArrayDynamic Programming |
| Palindrome Partitioning | Medium | 73.7% | 25.0% | StringDynamic ProgrammingBacktracking |
| Single Number | Easy | 77.3% | 25.0% | ArrayBit Manipulation |
| Copy List with Random Pointer | Medium | 62.4% | 25.0% | Hash TableLinked List |
| Evaluate Reverse Polish Notation | Medium | 57.0% | 25.0% | ArrayMathStack |
| Intersection of Two Linked Lists | Easy | 63.2% | 25.0% | Hash TableLinked ListTwo Pointers |
| Second Highest Salary | Medium | 46.3% | 25.0% | Database |
| Largest Number | Medium | 42.6% | 25.0% | ArrayStringGreedy+1 |
| Remove Linked List Elements | Easy | 53.8% | 25.0% | Linked ListRecursion |
| Count Primes | Medium | 35.7% | 25.0% | ArrayMathEnumeration+1 |
| Isomorphic Strings | Easy | 48.0% | 25.0% | Hash TableString |
| Contains Duplicate II | Easy | 50.8% | 25.0% | ArrayHash TableSliding Window |
| Basic Calculator | Hard | 46.5% | 25.0% | MathStringStack+1 |
| Implement Stack using Queues | Easy | 69.3% | 25.0% | StackDesignQueue |
| Power of Two | Easy | 49.8% | 25.0% | MathBit ManipulationRecursion |
| Palindrome Linked List | Easy | 57.4% | 25.0% | Linked ListTwo PointersStack+1 |
| Lowest Common Ancestor of a Binary Search Tree | Medium | 70.0% | 25.0% | TreeDepth-First SearchBinary Search Tree+1 |
| First Bad Version | Easy | 46.8% | 25.0% | Binary SearchInteractive |
| Find the Duplicate Number | Medium | 64.0% | 25.0% | ArrayTwo PointersBinary Search+1 |
| Word Pattern | Easy | 43.8% | 25.0% | Hash TableString |
| Binary Tree Vertical Order Traversal | Medium | 57.7% | 25.0% | |
| Odd Even Linked List | Medium | 62.3% | 25.0% | Linked List |
| Reconstruct Itinerary | Hard | 44.3% | 25.0% | ArrayStringDepth-First Search+4 |
| Nested List Weight Sum | Medium | 85.9% | 25.0% | |
| Reverse Vowels of a String | Easy | 60.6% | 25.0% | Two PointersString |
| Design Twitter | Medium | 44.2% | 25.0% | Hash TableLinked ListDesign+1 |
| Nth Digit | Medium | 37.1% | 25.0% | MathBinary Search |
| Valid Word Square | Easy | 42.8% | 25.0% | |
| Longest Repeating Character Replacement | Medium | 59.0% | 25.0% | Hash TableStringSliding Window |
| Path Sum III | Medium | 46.3% | 25.0% | TreeDepth-First SearchBinary Tree |
| Find All Duplicates in an Array | Medium | 76.8% | 25.0% | ArrayHash TableSorting |
| Find All Numbers Disappeared in an Array | Easy | 63.7% | 25.0% | ArrayHash Table |
| Minimum Number of Arrows to Burst Balloons | Medium | 61.2% | 25.0% | ArrayGreedySorting |
| Island Perimeter | Easy | 74.2% | 25.0% | ArrayDepth-First SearchBreadth-First Search+1 |
| Concatenated Words | Hard | 49.7% | 25.0% | ArrayStringDynamic Programming+3 |
| Max Consecutive Ones | Easy | 64.6% | 25.0% | Array |
| Reverse Pairs | Hard | 33.7% | 25.0% | ArrayBinary SearchDivide and Conquer+4 |
| Next Greater Element I | Easy | 75.7% | 25.0% | ArrayHash TableStack+1 |
| Find Largest Value in Each Tree Row | Medium | 66.3% | 25.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Coin Change II | Medium | 60.5% | 25.0% | ArrayDynamic Programming |
| Continuous Subarray Sum | Medium | 31.2% | 25.0% | ArrayHash TableMath+1 |
| K-diff Pairs in an Array | Medium | 45.6% | 25.0% | ArrayHash TableTwo Pointers+2 |
| Single Element in a Sorted Array | Medium | 59.2% | 25.0% | ArrayBinary Search |
| 01 Matrix | Medium | 53.3% | 25.0% | ArrayDynamic ProgrammingBreadth-First Search+1 |
| Array Partition | Easy | 81.5% | 25.0% | ArrayGreedySorting+1 |
| Can Place Flowers | Easy | 29.0% | 25.0% | ArrayGreedy |
| Sum of Square Numbers | Medium | 36.7% | 25.0% | MathTwo PointersBinary Search |
| Design Search Autocomplete System | Hard | 49.7% | 25.0% | |
| Palindromic Substrings | Medium | 72.5% | 25.0% | Two PointersStringDynamic Programming |
| Valid Parenthesis String | Medium | 39.8% | 25.0% | StringDynamic ProgrammingStack+1 |
| Top K Frequent Words | Medium | 60.0% | 25.0% | ArrayHash TableString+5 |
| Accounts Merge | Medium | 60.9% | 25.0% | ArrayHash TableString+4 |
| Max Chunks To Make Sorted II | Hard | 54.7% | 25.0% | ArrayStackGreedy+2 |
| Jewels and Stones | Easy | 89.5% | 25.0% | Hash TableString |
| Custom Sort String | Medium | 72.3% | 25.0% | Hash TableStringSorting |
| Similar String Groups | Hard | 56.1% | 25.0% | ArrayHash TableString+3 |
| Hand of Straights | Medium | 57.8% | 25.0% | ArrayHash TableGreedy+1 |
| Maximize Distance to Closest Person | Medium | 49.6% | 25.0% | Array |
| Transpose Matrix | Easy | 75.9% | 25.0% | ArrayMatrixSimulation |
| Koko Eating Bananas | Medium | 49.7% | 25.0% | ArrayBinary Search |
| Boats to Save People | Medium | 61.4% | 25.0% | ArrayTwo PointersGreedy+1 |
| Spiral Matrix III | Medium | 84.5% | 25.0% | ArrayMatrixSimulation |
| Online Stock Span | Medium | 68.7% | 25.0% | StackDesignMonotonic Stack+1 |
| Sort Array By Parity | Easy | 76.5% | 25.0% | ArrayTwo PointersSorting |
| Sum of Subarray Minimums | Medium | 38.3% | 25.0% | ArrayDynamic ProgrammingStack+1 |
| Shortest Bridge | Medium | 59.3% | 25.0% | ArrayDepth-First SearchBreadth-First Search+1 |
| Squares of a Sorted Array | Easy | 73.6% | 25.0% | ArrayTwo PointersSorting |
| Max Consecutive Ones III | Medium | 67.3% | 25.0% | ArrayBinary SearchSliding Window+1 |
| Pairs of Songs With Total Durations Divisible by 60 | Medium | 53.4% | 25.0% | ArrayHash TableCounting |
| Capacity To Ship Packages Within D Days | Medium | 73.5% | 25.0% | ArrayBinary Search |
| Article Views I | Easy | 76.7% | 25.0% | Database |
| Remove Zero Sum Consecutive Nodes from Linked List | Medium | 53.1% | 25.0% | Hash TableLinked List |
| Immediate Food Delivery II | Medium | 55.6% | 25.0% | Database |
| Average Selling Price | Easy | 37.1% | 25.0% | Database |
| Search Suggestions System | Medium | 65.2% | 25.0% | ArrayStringBinary Search+3 |
| Angle Between Hands of a Clock | Medium | 64.4% | 25.0% | Math |
| Product of the Last K Numbers | Medium | 62.9% | 25.0% | ArrayMathDesign+2 |
| Magnetic Force Between Two Balls | Medium | 71.9% | 25.0% | ArrayBinary SearchSorting |
| Customer Who Visited but Did Not Make Any Transactions | Easy | 67.6% | 25.0% | Database |
| Determine if Two Strings Are Close | Medium | 54.2% | 25.0% | Hash TableStringSorting+1 |
| Minimize Deviation in Array | Hard | 54.0% | 25.0% | ArrayGreedyHeap (Priority Queue)+1 |
| Merge Strings Alternately | Easy | 82.1% | 25.0% | Two PointersString |
| Sum of Subarray Ranges | Medium | 60.7% | 25.0% | ArrayStackMonotonic Stack |
| Rearrange Array Elements by Sign | Medium | 84.5% | 25.0% | ArrayTwo PointersSimulation |
| First Letter to Appear Twice | Easy | 74.9% | 25.0% | Hash TableStringBit Manipulation+1 |
| Flatten Deeply Nested Array | Medium | 65.5% | 25.0% | |
| Length of Longest Subarray With at Most K Frequency | Medium | 56.4% | 25.0% | ArrayHash TableSliding Window |
| Maximum Number of Operations With the Same Score II | Medium | 34.1% | 25.0% | ArrayDynamic ProgrammingMemoization |
| Summary Ranges | Easy | 53.9% | 25.0% | Array |
| Tree Diameter | Medium | 61.2% | 25.0% | |
| Knight Probability in Chessboard | Medium | 56.9% | 25.0% | Dynamic Programming |
| Palindrome Permutation | Easy | 68.6% | 25.0% | |
| Shortest Distance from All Buildings | Hard | 44.8% | 25.0% | |
| Web Crawler Multithreaded | Medium | 51.0% | 25.0% | |
| Word Pattern II | Medium | 48.8% | 25.0% | |
| Employee Free Time | Hard | 72.8% | 25.0% | |
| Max Chunks To Make Sorted | Medium | 64.1% | 25.0% | ArrayStackGreedy+2 |
| String Compression III | Medium | 67.0% | 25.0% | String |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.1% | 25.0% | TreeBreadth-First SearchBinary Tree |
| Robot Bounded In Circle | Medium | 56.4% | 25.0% | MathStringSimulation |
| Split Strings by Separator | Easy | 75.9% | 25.0% | ArrayString |
| Goat Latin | Easy | 69.9% | 25.0% | String |
| Jump Game VII | Medium | 26.3% | 25.0% | StringDynamic ProgrammingSliding Window+1 |
| Missing Ranges | Easy | 35.5% | 25.0% | |
| Best Poker Hand | Easy | 61.6% | 25.0% | ArrayHash TableCounting |
| Guess the Word | Hard | 36.9% | 25.0% | ArrayMathString+2 |
| Sliding Window Median | Hard | 38.9% | 25.0% | ArrayHash TableSliding Window+1 |
| Logger Rate Limiter | Easy | 76.8% | 25.0% | |
| Image Smoother | Easy | 69.1% | 25.0% | ArrayMatrix |
| Minimum Knight Moves | Medium | 41.7% | 25.0% | |
| Clone Graph | Medium | 64.7% | 25.0% | Hash TableDepth-First SearchBreadth-First Search+1 |
| Word Ladder II | Hard | 27.5% | 25.0% | Hash TableStringBacktracking+1 |
| Walking Robot Simulation | Medium | 58.4% | 25.0% | ArrayHash TableSimulation |
| Longest Substring with At Most K Distinct Characters | Medium | 49.9% | 25.0% | |
| Find Pivot Index | Easy | 62.1% | 25.0% | ArrayPrefix Sum |
| Number of Connected Components in an Undirected Graph | Medium | 64.8% | 25.0% | |
| Number of Matching Subsequences | Medium | 50.6% | 25.0% | ArrayHash TableString+4 |
| Intersection of Three Sorted Arrays | Easy | 80.0% | 25.0% | |
| Read N Characters Given Read4 | Easy | 42.5% | 25.0% | |
| Keys and Rooms | Medium | 75.5% | 25.0% | Depth-First SearchBreadth-First SearchGraph Theory |
| Design Log Storage System | Medium | 59.2% | 25.0% | |
| Optimize Water Distribution in a Village | Hard | 65.5% | 25.0% | |
| Read N Characters Given read4 II - Call Multiple Times | Hard | 43.2% | 25.0% | |
| Longest Common Subsequence | Medium | 58.9% | 25.0% | StringDynamic Programming |
| Minimize Maximum Component Cost | Medium | 43.4% | 25.0% | Binary SearchUnion-FindGraph Theory+1 |
| Binary Tree Right Side View | Medium | 69.5% | 25.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Short Encoding of Words | Medium | 60.8% | 25.0% | ArrayHash TableString+1 |
| Substring with Concatenation of All Words | Hard | 34.0% | 25.0% | Hash TableStringSliding Window |
| Binary Search Tree Iterator | Medium | 76.1% | 25.0% | StackTreeDesign+3 |
| Shortest Word Distance | Easy | 66.2% | 25.0% | |
| Search in a Binary Search Tree | Easy | 82.5% | 25.0% | TreeBinary Search TreeBinary Tree |
| Best Time to Buy and Sell Stock with Cooldown | Medium | 61.7% | 25.0% | ArrayDynamic Programming |
| Minimum Speed to Arrive on Time | Medium | 47.7% | 25.0% | ArrayBinary Search |
| Sudoku Solver | Hard | 65.4% | 25.0% | ArrayHash TableBacktracking+1 |
| Insert Delete GetRandom O(1) - Duplicates allowed | Hard | 36.4% | 25.0% | ArrayHash TableMath+2 |
| Find All Lonely Numbers in the Array | Medium | 62.7% | 25.0% | ArrayHash TableCounting |
| My Calendar II | Medium | 62.9% | 25.0% | ArrayBinary SearchDesign+3 |
| Design Memory Allocator | Medium | 49.7% | 25.0% | ArrayHash TableDesign+1 |
| All Paths From Source to Target | Medium | 83.5% | 25.0% | BacktrackingDepth-First SearchBreadth-First Search+1 |
| Interval List Intersections | Medium | 72.9% | 25.0% | ArrayTwo PointersSweep Line |
| Shortest Path in Binary Matrix | Medium | 51.1% | 25.0% | ArrayBreadth-First SearchMatrix |
| Convert Sorted List to Binary Search Tree | Medium | 65.9% | 25.0% | Linked ListDivide and ConquerTree+2 |
| Partition to K Equal Sum Subsets | Medium | 38.4% | 25.0% | ArrayDynamic ProgrammingBacktracking+3 |
| Total Hamming Distance | Medium | 54.6% | 25.0% | ArrayMathBit Manipulation |
| Maximum Population Year | Easy | 63.6% | 25.0% | ArrayCountingPrefix Sum |
| Find a Peak Element II | Medium | 54.4% | 25.0% | ArrayBinary SearchMatrix |
| Counting Bits | Easy | 80.4% | 25.0% | Dynamic ProgrammingBit Manipulation |
| Sentence Similarity II | Medium | 51.1% | 25.0% | |
| Paths in Matrix Whose Sum Is Divisible by K | Hard | 58.7% | 25.0% | ArrayDynamic ProgrammingMatrix |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 25.0% | ArrayDynamic ProgrammingDepth-First Search+5 |
| Design Linked List | Medium | 29.8% | 25.0% | Linked ListDesign |
| Encode and Decode TinyURL | Medium | 86.6% | 25.0% | Hash TableStringDesign+1 |
| Water and Jug Problem | Medium | 44.8% | 25.0% | MathDepth-First SearchBreadth-First Search |
| Swap Nodes in Pairs | Medium | 68.9% | 25.0% | Linked ListRecursion |
| Minimum Size Subarray Sum | Medium | 51.0% | 25.0% | ArrayBinary SearchSliding Window+1 |
| Non-overlapping Intervals | Medium | 56.7% | 25.0% | ArrayDynamic ProgrammingGreedy+1 |
| The Maze | Medium | 60.3% | 25.0% | |
| Number of Recent Calls | Easy | 78.1% | 25.0% | DesignQueueData Stream |
| Evaluate Division | Medium | 64.0% | 25.0% | ArrayStringDepth-First Search+4 |
| Sort an Array | Medium | 55.9% | 25.0% | ArrayDivide and ConquerSorting+5 |
| Brace Expansion | Medium | 66.8% | 25.0% | |
| Customers Who Bought All Products | Medium | 63.7% | 25.0% | Database |
| Assign Cookies | Easy | 54.7% | 25.0% | ArrayTwo PointersGreedy+1 |
| Word Search II | Hard | 38.1% | 25.0% | ArrayStringBacktracking+2 |