| LRU Cache | Medium | 46.8% | 100.0% | Hash TableLinked ListDesign+1 |
| Two Sum | Easy | 57.1% | 88.4% | ArrayHash Table |
| Number of Islands | Medium | 63.8% | 85.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Merge Intervals | Medium | 51.2% | 84.7% | ArraySorting |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 79.0% | ArrayDynamic Programming |
| Design Hit Counter | Medium | 69.6% | 78.5% | ArrayBinary SearchDesign+2 |
| Longest Common Prefix | Easy | 47.1% | 78.5% | ArrayStringTrie |
| Rotate Array | Medium | 44.5% | 77.9% | ArrayMathTwo Pointers |
| Reverse Linked List | Easy | 80.3% | 76.7% | Linked ListRecursion |
| Valid Sudoku | Medium | 64.2% | 76.7% | ArrayHash TableMatrix |
| Group Anagrams | Medium | 72.2% | 76.1% | ArrayHash TableString+1 |
| Top K Frequent Elements | Medium | 65.9% | 76.1% | ArrayHash TableDivide and Conquer+5 |
| Course Schedule II | Medium | 55.0% | 73.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Course Schedule | Medium | 50.8% | 73.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Valid Parentheses | Easy | 43.7% | 72.7% | StringStack |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 72.0% | Hash TableStringSliding Window |
| Product of Array Except Self | Medium | 68.6% | 72.0% | ArrayPrefix Sum |
| Valid Palindrome | Easy | 52.8% | 70.4% | Two PointersString |
| Rotate Image | Medium | 79.4% | 70.4% | ArrayMathMatrix |
| Reverse Words in a String | Medium | 55.6% | 70.4% | Two PointersString |
| Kth Largest Element in an Array | Medium | 68.8% | 69.5% | ArrayDivide and ConquerSorting+2 |
| Spiral Matrix | Medium | 56.2% | 68.6% | ArrayMatrixSimulation |
| Best Time to Buy and Sell Stock II | Medium | 70.8% | 68.6% | ArrayDynamic ProgrammingGreedy |
| Maximum Subarray | Medium | 53.0% | 68.6% | ArrayDivide and ConquerDynamic Programming |
| Reverse Integer | Medium | 31.5% | 67.7% | Math |
| Merge k Sorted Lists | Hard | 58.9% | 66.7% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Meeting Rooms II | Medium | 52.6% | 65.7% | ArrayTwo PointersGreedy+3 |
| Trapping Rain Water | Hard | 66.8% | 65.7% | ArrayTwo PointersDynamic Programming+2 |
| Time Based Key-Value Store | Medium | 49.7% | 64.6% | Hash TableStringBinary Search+1 |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.8% | 64.6% | TreeDepth-First SearchBinary Tree |
| Subarray Sum Equals K | Medium | 46.8% | 63.4% | ArrayHash TablePrefix Sum |
| Subarray Product Less Than K | Medium | 53.9% | 63.4% | ArrayBinary SearchSliding Window+1 |
| Median of Two Sorted Arrays | Hard | 46.0% | 63.4% | ArrayBinary SearchDivide and Conquer |
| Reverse Bits | Easy | 67.8% | 63.4% | Divide and ConquerBit Manipulation |
| Find First and Last Position of Element in Sorted Array | Medium | 48.4% | 62.2% | ArrayBinary Search |
| Snapshot Array | Medium | 36.7% | 62.2% | ArrayHash TableBinary Search+1 |
| Design Circular Queue | Medium | 54.0% | 62.2% | ArrayLinked ListDesign+1 |
| Number of 1 Bits | Easy | 76.4% | 62.2% | Divide and ConquerBit Manipulation |
| Merge Two Sorted Lists | Easy | 68.0% | 62.2% | Linked ListRecursion |
| Find Median from Data Stream | Hard | 54.2% | 60.9% | Two PointersDesignSorting+2 |
| Move Zeroes | Easy | 63.6% | 60.9% | ArrayTwo Pointers |
| Word Ladder | Hard | 44.9% | 59.5% | Hash TableStringBreadth-First Search |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 59.5% | ArrayHash TableMath+2 |
| Basic Calculator II | Medium | 46.7% | 59.5% | MathStringStack |
| Min Stack | Medium | 57.7% | 59.5% | StackDesign |
| Climbing Stairs | Easy | 53.9% | 59.5% | MathDynamic ProgrammingMemoization |
| Compare Version Numbers | Medium | 46.1% | 59.5% | Two PointersString |
| Search a 2D Matrix II | Medium | 56.9% | 59.5% | ArrayBinary SearchDivide and Conquer+1 |
| Merge Sorted Array | Easy | 54.4% | 58.1% | ArrayTwo PointersSorting |
| Word Break | Medium | 49.1% | 58.1% | ArrayHash TableString+3 |
| String Compression | Medium | 59.6% | 58.1% | Two PointersString |
| Find the Index of the First Occurrence in a String | Easy | 46.3% | 58.1% | Two PointersStringString Matching |
| Peeking Iterator | Medium | 61.3% | 58.1% | ArrayDesignIterator |
| 3Sum | Medium | 38.6% | 56.5% | ArrayTwo PointersSorting |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 56.5% | Hash TableStringDesign+1 |
| Design Tic-Tac-Toe | Medium | 58.7% | 56.5% | ArrayHash TableDesign+2 |
| Binary Tree Level Order Traversal | Medium | 72.2% | 56.5% | TreeBreadth-First SearchBinary Tree |
| Pascal's Triangle | Easy | 78.7% | 56.5% | ArrayDynamic Programming |
| Ransom Note | Easy | 65.7% | 56.5% | Hash TableStringCounting |
| Sqrt(x) | Easy | 41.4% | 54.7% | MathBinary Search |
| Max Points on a Line | Hard | 30.3% | 54.7% | ArrayHash TableMath+1 |
| Delete Node in a Linked List | Medium | 83.6% | 54.7% | Linked List |
| Number of Squareful Arrays | Hard | 51.2% | 54.7% | ArrayHash TableMath+4 |
| Number of Pairs of Strings With Concatenation Equal to Target | Medium | 75.4% | 54.7% | ArrayHash TableString+1 |
| Longest Consecutive Sequence | Medium | 47.0% | 52.8% | ArrayHash TableUnion-Find |
| First Unique Character in a String | Easy | 65.1% | 52.8% | Hash TableStringQueue+1 |
| Calculate Score After Performing Instructions | Medium | 56.9% | 52.8% | ArrayHash TableString+1 |
| Find Servers That Handled Most Number of Requests | Hard | 45.2% | 52.8% | ArrayHeap (Priority Queue)Simulation+1 |
| Regular Expression Matching | Hard | 30.5% | 52.8% | StringDynamic ProgrammingRecursion |
| Remove Duplicates from Sorted Array | Easy | 62.3% | 52.8% | ArrayTwo Pointers |
| Design HashMap | Easy | 66.4% | 52.8% | ArrayHash TableLinked List+2 |
| Best Time to Buy and Sell Stock with Transaction Fee | Medium | 71.7% | 52.8% | ArrayDynamic ProgrammingGreedy |
| Maximum Depth of Binary Tree | Easy | 77.9% | 52.8% | TreeDepth-First SearchBreadth-First Search+1 |
| Maximal Square | Medium | 50.0% | 52.8% | ArrayDynamic ProgrammingMatrix |
| Binary Tree Paths | Easy | 68.2% | 52.8% | StringBacktrackingTree+2 |
| Find the Grid of Region Average | Medium | 43.3% | 52.8% | ArrayMatrix |
| Count the Number of Incremovable Subarrays II | Hard | 40.1% | 52.8% | ArrayTwo PointersBinary Search |
| Maximum Rows Covered by Columns | Medium | 57.7% | 52.8% | ArrayBacktrackingBit Manipulation+2 |
| Count the Number of Incremovable Subarrays I | Easy | 56.3% | 52.8% | ArrayTwo PointersBinary Search+1 |
| Array Nesting | Medium | 56.5% | 52.8% | ArrayDepth-First Search |
| Flatten Nested List Iterator | Medium | 65.6% | 50.7% | StackTreeDepth-First Search+3 |
| Remove Nth Node From End of List | Medium | 51.0% | 50.7% | Linked ListTwo Pointers |
| Two Sum II - Input Array Is Sorted | Medium | 64.6% | 50.7% | ArrayTwo PointersBinary Search |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 50.7% | StringTreeDepth-First Search+3 |
| Task Scheduler | Medium | 62.7% | 48.4% | ArrayHash TableGreedy+3 |
| Longest Palindromic Substring | Medium | 37.4% | 48.4% | Two PointersStringDynamic Programming |
| Container With Most Water | Medium | 59.6% | 48.4% | ArrayTwo PointersGreedy |
| Letter Combinations of a Phone Number | Medium | 65.5% | 48.4% | Hash TableStringBacktracking |
| Generate Parentheses | Medium | 78.3% | 48.4% | StringDynamic ProgrammingBacktracking |
| Decode String | Medium | 62.3% | 48.4% | StringStackRecursion |
| Find K Closest Elements | Medium | 49.4% | 48.4% | ArrayTwo PointersBinary Search+3 |
| Find Winner on a Tic Tac Toe Game | Easy | 54.5% | 48.4% | ArrayHash TableMatrix+1 |
| Remove All Adjacent Duplicates In String | Easy | 72.8% | 48.4% | StringStack |
| Search in Rotated Sorted Array | Medium | 44.1% | 48.4% | ArrayBinary Search |
| Implement Queue using Stacks | Easy | 69.4% | 48.4% | StackDesignQueue |
| Fibonacci Number | Easy | 73.9% | 48.4% | MathDynamic ProgrammingRecursion+1 |
| Meeting Rooms | Easy | 59.3% | 45.7% | ArraySorting |
| Integer to English Words | Hard | 34.8% | 45.7% | MathStringRecursion |
| Text Justification | Hard | 50.5% | 45.7% | ArrayStringSimulation |
| Jump Game | Medium | 40.5% | 45.7% | ArrayDynamic ProgrammingGreedy |
| Reverse String | Easy | 80.6% | 45.7% | Two PointersString |
| Flood Fill | Easy | 67.9% | 45.7% | ArrayDepth-First SearchBreadth-First Search+1 |
| Insert Interval | Medium | 44.8% | 42.6% | Array |
| Sliding Window Maximum | Hard | 48.5% | 42.6% | ArrayQueueSliding Window+2 |
| String to Integer (atoi) | Medium | 20.6% | 42.6% | String |
| Roman to Integer | Easy | 66.3% | 42.6% | Hash TableMathString |
| Permutations | Medium | 81.7% | 42.6% | ArrayBacktracking |
| Coin Change | Medium | 48.0% | 42.6% | ArrayDynamic ProgrammingBreadth-First Search |
| Total Hamming Distance | Medium | 54.6% | 39.0% | ArrayMathBit Manipulation |
| Edit Distance | Medium | 60.2% | 39.0% | StringDynamic Programming |
| Serialize and Deserialize N-ary Tree | Hard | 68.6% | 39.0% | StringTreeDepth-First Search+1 |
| Find All Lonely Numbers in the Array | Medium | 62.7% | 39.0% | ArrayHash TableCounting |
| Best Time to Buy and Sell Stock with Cooldown | Medium | 61.7% | 39.0% | ArrayDynamic Programming |
| Path Sum | Easy | 54.5% | 39.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Fizz Buzz | Easy | 75.3% | 39.0% | MathStringSimulation |
| Gas Station | Medium | 47.5% | 39.0% | ArrayGreedy |
| Add Two Numbers | Medium | 48.0% | 39.0% | Linked ListMathRecursion |
| Cheapest Flights Within K Stops | Medium | 41.4% | 39.0% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+3 |
| Keys and Rooms | Medium | 75.5% | 39.0% | Depth-First SearchBreadth-First SearchGraph Theory |
| Interleaving String | Medium | 43.5% | 39.0% | StringDynamic Programming |
| Valid Anagram | Easy | 67.8% | 39.0% | Hash TableStringSorting |
| Missing Number | Easy | 71.7% | 39.0% | ArrayHash TableMath+3 |
| LFU Cache | Hard | 48.6% | 39.0% | Hash TableLinked ListDesign+1 |
| Middle of the Linked List | Easy | 81.6% | 39.0% | Linked ListTwo Pointers |
| Set Matrix Zeroes | Medium | 62.5% | 39.0% | ArrayHash TableMatrix |
| Word Search | Medium | 46.9% | 39.0% | ArrayStringBacktracking+2 |
| Rotting Oranges | Medium | 58.2% | 39.0% | ArrayBreadth-First SearchMatrix |
| Maximum Frequency Stack | Hard | 66.6% | 39.0% | Hash TableStackDesign+1 |
| Lowest Common Ancestor of a Binary Tree III | Medium | 82.9% | 39.0% | Hash TableTwo PointersTree+1 |
| Distribute Money to Maximum Children | Easy | 20.5% | 39.0% | MathGreedy |
| Design Memory Allocator | Medium | 49.7% | 34.7% | ArrayHash TableDesign+1 |
| Brace Expansion | Medium | 66.8% | 34.7% | StringBacktrackingStack+2 |
| Odd Even Linked List | Medium | 62.3% | 34.7% | Linked List |
| Binary Tree Vertical Order Traversal | Medium | 57.8% | 34.7% | Hash TableTreeDepth-First Search+3 |
| Design Log Storage System | Medium | 59.3% | 34.7% | Hash TableStringDesign+1 |
| Sort Colors | Medium | 69.2% | 34.7% | ArrayTwo PointersSorting |
| Combination Sum | Medium | 76.1% | 34.7% | ArrayBacktracking |
| Simplify Path | Medium | 50.0% | 34.7% | StringStack |
| Reverse Linked List II | Medium | 51.0% | 34.7% | Linked List |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 34.7% | Dynamic ProgrammingTreeDepth-First Search+1 |
| House Robber | Medium | 52.9% | 34.7% | ArrayDynamic Programming |
| Apple Redistribution into Boxes | Easy | 78.5% | 34.7% | ArrayGreedySorting |
| Kth Smallest Element in a Sorted Matrix | Medium | 64.4% | 34.7% | ArrayBinary SearchSorting+2 |
| Exam Room | Medium | 43.2% | 34.7% | DesignHeap (Priority Queue)Ordered Set |
| Best Time to Buy and Sell Stock IV | Hard | 49.5% | 34.7% | ArrayDynamic Programming |
| Alien Dictionary | Hard | 37.1% | 34.7% | ArrayStringDepth-First Search+3 |
| Design Add and Search Words Data Structure | Medium | 48.2% | 34.7% | StringDepth-First SearchDesign+1 |
| Maximum Path Quality of a Graph | Hard | 61.7% | 34.7% | ArrayBacktrackingGraph Theory |
| Convert Sorted Array to Binary Search Tree | Easy | 75.2% | 34.7% | ArrayDivide and ConquerTree+2 |
| Find Peak Element | Medium | 46.8% | 34.7% | ArrayBinary Search |
| Happy Number | Easy | 59.3% | 34.7% | Hash TableMathTwo Pointers |
| H-Index | Medium | 41.2% | 34.7% | ArraySortingCounting Sort |
| Find All Anagrams in a String | Medium | 53.3% | 34.7% | Hash TableStringSliding Window |
| Palindromic Substrings | Medium | 72.6% | 34.7% | Two PointersStringDynamic Programming |
| Valid Palindrome II | Easy | 44.0% | 34.7% | Two PointersStringGreedy |
| Capacity To Ship Packages Within D Days | Medium | 73.5% | 34.7% | ArrayBinary Search |
| Knight Probability in Chessboard | Medium | 56.9% | 34.7% | Dynamic Programming |
| Validate IP Address | Medium | 28.2% | 34.7% | String |
| Best Time to Buy and Sell Stock III | Hard | 53.2% | 34.7% | ArrayDynamic Programming |
| Find the Celebrity | Medium | 48.9% | 29.1% | Two PointersGraph TheoryInteractive |
| Minimum Knight Moves | Medium | 41.8% | 29.1% | Breadth-First Search |
| Remove Element | Easy | 61.4% | 29.1% | ArrayTwo Pointers |
| Add Binary | Easy | 57.7% | 29.1% | MathStringBit Manipulation+1 |
| Search a 2D Matrix | Medium | 53.6% | 29.1% | ArrayBinary SearchMatrix |
| Largest Rectangle in Histogram | Hard | 49.4% | 29.1% | ArrayStackMonotonic Stack |
| Validate Binary Search Tree | Medium | 35.4% | 29.1% | TreeDepth-First SearchBinary Search Tree+1 |
| Reorder List | Medium | 64.6% | 29.1% | Linked ListTwo PointersStack+1 |
| Find Minimum in Rotated Sorted Array | Medium | 53.8% | 29.1% | ArrayBinary Search |
| The Skyline Problem | Hard | 45.0% | 29.1% | ArrayDivide and ConquerBinary Indexed Tree+5 |
| Intersection of Two Arrays | Easy | 77.5% | 29.1% | ArrayHash TableTwo Pointers+2 |
| Island Perimeter | Easy | 74.3% | 29.1% | ArrayDepth-First SearchBreadth-First Search+1 |
| Next Greater Element II | Medium | 67.9% | 29.1% | ArrayStackMonotonic Stack |
| Maximum Product of Three Numbers | Easy | 45.7% | 29.1% | ArrayMathSorting |
| Random Pick with Weight | Medium | 48.9% | 29.1% | ArrayMathBinary Search+2 |
| Sum of Subarray Minimums | Medium | 38.3% | 29.1% | ArrayDynamic ProgrammingStack+1 |
| House Robber II | Medium | 44.6% | 29.1% | ArrayDynamic Programming |
| Permutations II | Medium | 63.0% | 29.1% | ArrayBacktrackingSorting |
| Determine if Two Strings Are Close | Medium | 54.2% | 29.1% | Hash TableStringSorting+1 |
| String Compression III | Medium | 67.0% | 29.1% | String |
| Employee Free Time | Hard | 72.8% | 29.1% | ArraySweep LineSorting+1 |
| Robot Bounded In Circle | Medium | 56.5% | 29.1% | MathStringSimulation |
| Intersection of Two Linked Lists | Easy | 63.2% | 29.1% | Hash TableLinked ListTwo Pointers |
| Same Tree | Easy | 66.7% | 29.1% | TreeDepth-First SearchBreadth-First Search+1 |
| Word Ladder II | Hard | 27.5% | 29.1% | Hash TableStringBacktracking+1 |
| Longest Substring with At Most K Distinct Characters | Medium | 49.9% | 29.1% | Hash TableStringSliding Window |
| Read N Characters Given read4 II - Call Multiple Times | Hard | 43.2% | 29.1% | ArraySimulationInteractive |
| Shortest Path in Binary Matrix | Medium | 51.1% | 29.1% | ArrayBreadth-First SearchMatrix |
| Short Encoding of Words | Medium | 60.8% | 29.1% | ArrayHash TableString+1 |
| Sudoku Solver | Hard | 65.4% | 29.1% | ArrayHash TableBacktracking+1 |
| Convert Sorted List to Binary Search Tree | Medium | 66.0% | 29.1% | Linked ListDivide and ConquerTree+2 |
| Contains Duplicate | Easy | 64.1% | 29.1% | ArrayHash TableSorting |
| Evaluate Reverse Polish Notation | Medium | 57.1% | 29.1% | ArrayMathStack |
| Basic Calculator | Hard | 46.6% | 29.1% | MathStringStack+1 |
| K Closest Points to Origin | Medium | 68.8% | 29.1% | ArrayMathDivide and Conquer+4 |
| Reconstruct Itinerary | Hard | 44.3% | 29.1% | ArrayStringDepth-First Search+4 |
| Best Poker Hand | Easy | 61.6% | 29.1% | ArrayHash TableCounting |
| Find Largest Value in Each Tree Row | Medium | 66.3% | 29.1% | TreeDepth-First SearchBreadth-First Search+1 |
| Logger Rate Limiter | Easy | 76.8% | 29.1% | Hash TableDesignData Stream |
| Continuous Subarray Sum | Medium | 31.2% | 29.1% | ArrayHash TableMath+1 |
| Binary Tree Right Side View | Medium | 69.5% | 29.1% | TreeDepth-First SearchBreadth-First Search+1 |
| Design Browser History | Medium | 78.2% | 29.1% | ArrayLinked ListStack+3 |
| Find Pivot Index | Easy | 62.1% | 29.1% | ArrayPrefix Sum |
| Top K Frequent Words | Medium | 60.0% | 29.1% | ArrayHash TableString+5 |
| Interval List Intersections | Medium | 72.9% | 29.1% | ArrayTwo PointersSweep Line |
| My Calendar II | Medium | 62.9% | 29.1% | ArrayBinary SearchDesign+3 |
| 4Sum | Medium | 40.0% | 29.1% | ArrayTwo PointersSorting |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 29.1% | ArrayDynamic ProgrammingDepth-First Search+5 |
| Paths in Matrix Whose Sum Is Divisible by K | Hard | 58.7% | 29.1% | ArrayDynamic ProgrammingMatrix |
| Construct Binary Tree from Preorder and Postorder Traversal | Medium | 78.1% | 21.7% | ArrayHash TableDivide and Conquer+2 |
| Convert Object to JSON String | Medium | 78.0% | 21.7% | |
| All Nodes Distance K in Binary Tree | Medium | 67.4% | 21.7% | Hash TableTreeDepth-First Search+2 |
| Design Task Manager | Medium | 49.1% | 21.7% | Hash TableDesignHeap (Priority Queue)+1 |
| Minimum Falling Path Sum | Medium | 60.8% | 21.7% | ArrayDynamic ProgrammingMatrix |
| Permutation in String | Medium | 48.5% | 21.7% | Hash TableTwo PointersString+1 |
| Maximum Sum Circular Subarray | Medium | 49.5% | 21.7% | ArrayDivide and ConquerDynamic Programming+2 |
| All O`one Data Structure | Hard | 44.2% | 21.7% | Hash TableLinked ListDesign+1 |
| Parse Lisp Expression | Hard | 53.5% | 21.7% | Hash TableStringStack+1 |
| Find Distance in a Binary Tree | Medium | 74.3% | 21.7% | Hash TableTreeDepth-First Search+2 |
| Koko Eating Bananas | Medium | 49.7% | 21.7% | ArrayBinary Search |
| First Missing Positive | Hard | 42.5% | 21.7% | ArrayHash Table |
| Jump Game II | Medium | 42.5% | 21.7% | ArrayDynamic ProgrammingGreedy |
| Minimum Window Substring | Hard | 47.0% | 21.7% | Hash TableStringSliding Window |
| Decode Ways | Medium | 37.6% | 21.7% | StringDynamic Programming |
| Symmetric Tree | Easy | 60.8% | 21.7% | TreeDepth-First SearchBreadth-First Search+1 |
| Copy List with Random Pointer | Medium | 62.4% | 21.7% | Hash TableLinked List |
| Implement Stack using Queues | Easy | 69.4% | 21.7% | StackDesignQueue |
| Lowest Common Ancestor of a Binary Search Tree | Medium | 70.1% | 21.7% | TreeDepth-First SearchBinary Search Tree+1 |
| First Bad Version | Easy | 46.9% | 21.7% | Binary SearchInteractive |
| Max Consecutive Ones | Easy | 64.6% | 21.7% | Array |
| Reverse Pairs | Hard | 33.7% | 21.7% | ArrayBinary SearchDivide and Conquer+4 |
| 01 Matrix | Medium | 53.4% | 21.7% | ArrayDynamic ProgrammingBreadth-First Search+1 |
| Diameter of Binary Tree | Easy | 65.1% | 21.7% | TreeDepth-First SearchBinary Tree |
| Can Place Flowers | Easy | 29.1% | 21.7% | ArrayGreedy |
| Asteroid Collision | Medium | 47.2% | 21.7% | ArrayStackSimulation |
| Similar String Groups | Hard | 56.1% | 21.7% | ArrayHash TableString+3 |
| Transpose Matrix | Easy | 75.9% | 21.7% | ArrayMatrixSimulation |
| Snakes and Ladders | Medium | 48.0% | 21.7% | ArrayBreadth-First SearchMatrix |
| Product of the Last K Numbers | Medium | 62.9% | 21.7% | ArrayMathDesign+2 |
| Minimum Remove to Make Valid Parentheses | Medium | 71.3% | 21.7% | StringStack |
| Verifying an Alien Dictionary | Easy | 55.9% | 21.7% | ArrayHash TableString |
| Goat Latin | Easy | 69.9% | 21.7% | String |
| Shortest Distance from All Buildings | Hard | 44.9% | 21.7% | ArrayBreadth-First SearchMatrix |
| Web Crawler Multithreaded | Medium | 51.0% | 21.7% | Depth-First SearchBreadth-First SearchConcurrency |
| Sum of Subarray Ranges | Medium | 60.8% | 21.7% | ArrayStackMonotonic Stack |
| Word Pattern II | Medium | 48.8% | 21.7% | Hash TableStringBacktracking |
| Clone Graph | Medium | 64.7% | 21.7% | Hash TableDepth-First SearchBreadth-First Search+1 |
| Split Strings by Separator | Easy | 76.0% | 21.7% | ArrayString |
| Walking Robot Simulation | Medium | 58.4% | 21.7% | ArrayHash TableSimulation |
| First Letter to Appear Twice | Easy | 74.9% | 21.7% | Hash TableStringBit Manipulation+1 |
| Guess the Word | Hard | 36.9% | 21.7% | ArrayMathString+2 |
| Sliding Window Median | Hard | 38.9% | 21.7% | ArrayHash TableSliding Window+1 |
| Max Chunks To Make Sorted | Medium | 64.1% | 21.7% | ArrayStackGreedy+2 |
| Intersection of Three Sorted Arrays | Easy | 80.0% | 21.7% | ArrayHash TableBinary Search+1 |
| Optimize Water Distribution in a Village | Hard | 65.5% | 21.7% | Union-FindGraph TheoryHeap (Priority Queue)+1 |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.2% | 21.7% | TreeBreadth-First SearchBinary Tree |
| Max Area of Island | Medium | 73.8% | 21.7% | ArrayDepth-First SearchBreadth-First Search+2 |
| Number of Changing Keys | Easy | 80.5% | 21.7% | String |
| Minimize Maximum Component Cost | Medium | 43.4% | 21.7% | Binary SearchUnion-FindGraph Theory+1 |
| Second Highest Salary | Medium | 46.4% | 21.7% | Database |
| Maximize Distance to Closest Person | Medium | 49.6% | 21.7% | Array |
| Spiral Matrix III | Medium | 84.5% | 21.7% | ArrayMatrixSimulation |
| Binary Search Tree Iterator | Medium | 76.2% | 21.7% | StackTreeDesign+3 |
| Shortest Word Distance | Easy | 66.2% | 21.7% | ArrayString |
| Subsets II | Medium | 60.9% | 21.7% | ArrayBacktrackingBit Manipulation |
| Read N Characters Given Read4 | Easy | 42.5% | 21.7% | ArraySimulationInteractive |
| Minimum Speed to Arrive on Time | Medium | 47.7% | 21.7% | ArrayBinary Search |
| Count Primes | Medium | 35.8% | 21.7% | ArrayMathEnumeration+1 |
| Reverse Nodes in k-Group | Hard | 65.4% | 21.7% | Linked ListRecursion |
| Image Smoother | Easy | 69.1% | 21.7% | ArrayMatrix |
| Longest Common Subsequence | Medium | 58.9% | 21.7% | StringDynamic Programming |
| Zigzag Conversion | Medium | 53.6% | 21.7% | String |
| Counting Bits | Easy | 80.4% | 21.7% | Dynamic ProgrammingBit Manipulation |
| Reverse Vowels of a String | Easy | 60.7% | 21.7% | Two PointersString |
| Remove Linked List Elements | Easy | 53.9% | 21.7% | Linked ListRecursion |
| Contains Duplicate II | Easy | 50.8% | 21.7% | ArrayHash TableSliding Window |
| Maximum Population Year | Easy | 63.7% | 21.7% | ArrayCountingPrefix Sum |
| Water and Jug Problem | Medium | 45.0% | 21.7% | MathDepth-First SearchBreadth-First Search |
| Design Twitter | Medium | 44.2% | 21.7% | Hash TableLinked ListDesign+1 |
| Longest Repeating Character Replacement | Medium | 59.1% | 21.7% | Hash TableStringSliding Window |
| Dot Product of Two Sparse Vectors | Medium | 89.9% | 21.7% | ArrayHash TableTwo Pointers+1 |
| Substring with Concatenation of All Words | Hard | 34.0% | 21.7% | Hash TableStringSliding Window |
| Sentence Similarity II | Medium | 51.1% | 21.7% | ArrayHash TableString+3 |
| Design Linked List | Medium | 29.9% | 21.7% | Linked ListDesign |
| Encode and Decode TinyURL | Medium | 86.6% | 21.7% | Hash TableStringDesign+1 |
| Minimum Size Subarray Sum | Medium | 51.1% | 21.7% | ArrayBinary SearchSliding Window+1 |
| Non-overlapping Intervals | Medium | 56.7% | 21.7% | ArrayDynamic ProgrammingGreedy+1 |
| The Maze | Medium | 60.3% | 21.7% | ArrayDepth-First SearchBreadth-First Search+1 |
| Number of Recent Calls | Easy | 78.2% | 21.7% | DesignQueueData Stream |
| Evaluate Division | Medium | 64.0% | 21.7% | ArrayStringDepth-First Search+4 |
| Sort an Array | Medium | 55.9% | 21.7% | ArrayDivide and ConquerSorting+5 |
| Assign Cookies | Easy | 54.7% | 21.7% | ArrayTwo PointersGreedy+1 |
| Word Search II | Hard | 38.1% | 21.7% | ArrayStringBacktracking+2 |
| Meeting Scheduler | Medium | 55.2% | 21.7% | ArrayTwo PointersSorting |
| One Edit Distance | Medium | 34.6% | 21.7% | Two PointersString |
| Exclusive Time of Functions | Medium | 66.1% | 21.7% | ArrayStack |
| Remove Duplicates from Sorted List II | Medium | 51.3% | 21.7% | Linked ListTwo Pointers |
| Moving Average from Data Stream | Easy | 80.2% | 21.7% | ArrayDesignQueue+1 |
| Longest Happy Prefix | Hard | 51.9% | 21.7% | StringRolling HashString Matching+1 |
| Balanced Binary Tree | Easy | 57.9% | 21.7% | TreeDepth-First SearchBinary Tree |
| Valid Parenthesis String | Medium | 39.8% | 21.7% | StringDynamic ProgrammingStack+1 |