| Max Stack | Hard | 45.9% | 100.0% | Linked ListStackDesign+2 |
| Nested List Weight Sum II | Medium | 66.8% | 94.7% | StackDepth-First SearchBreadth-First Search |
| All O`one Data Structure | Hard | 44.2% | 94.4% | Hash TableLinked ListDesign+1 |
| Word Ladder | Hard | 44.9% | 79.1% | Hash TableStringBreadth-First Search |
| Find the Celebrity | Medium | 48.9% | 79.1% | Two PointersGraphInteractive |
| Nested List Weight Sum | Medium | 85.9% | 77.8% | Depth-First SearchBreadth-First Search |
| Design Authentication Manager | Medium | 58.4% | 77.8% | Hash TableLinked ListDesign+1 |
| Find Leaves of Binary Tree | Medium | 81.3% | 77.4% | TreeDepth-First SearchBinary Tree |
| Shortest Word Distance II | Medium | 62.7% | 77.4% | ArrayHash TableTwo Pointers+2 |
| Maximum Subarray | Medium | 53.0% | 77.4% | ArrayDivide and ConquerDynamic Programming |
| Max Consecutive Ones III | Medium | 67.3% | 76.7% | ArrayBinary SearchSliding Window+1 |
| Valid Parentheses | Easy | 43.7% | 76.5% | StringStack |
| Number of Islands | Medium | 63.8% | 75.6% | ArrayDepth-First SearchBreadth-First Search+2 |
| Maximum Product Subarray | Medium | 36.0% | 73.0% | ArrayDynamic Programming |
| Can Place Flowers | Easy | 29.1% | 72.4% | ArrayGreedy |
| Search in Rotated Sorted Array | Medium | 44.1% | 71.3% | ArrayBinary Search |
| Pow(x, n) | Medium | 38.3% | 70.6% | MathRecursion |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 69.3% | ArrayHash TableMath+2 |
| Binary Tree Upside Down | Medium | 65.4% | 69.3% | TreeDepth-First SearchBinary Tree |
| Partition to K Equal Sum Subsets | Medium | 38.4% | 68.7% | ArrayDynamic ProgrammingBacktracking+3 |
| Find First and Last Position of Element in Sorted Array | Medium | 48.4% | 67.9% | ArrayBinary Search |
| Paint House | Medium | 64.3% | 67.9% | ArrayDynamic Programming |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 66.4% | StringTreeDepth-First Search+3 |
| Maximize Subarrays After Removing One Conflicting Pair | Hard | 64.7% | 65.1% | ArraySegment TreeEnumeration+1 |
| Minimum Window Substring | Hard | 47.0% | 64.8% | Hash TableStringSliding Window |
| Building H2O | Medium | 58.4% | 64.8% | Concurrency |
| Exclusive Time of Functions | Medium | 66.1% | 63.9% | ArrayStack |
| Factor Combinations | Medium | 50.5% | 63.9% | Backtracking |
| Shortest Word Distance | Easy | 66.2% | 63.9% | ArrayString |
| Maximum Depth of Binary Tree | Easy | 77.9% | 63.9% | TreeDepth-First SearchBreadth-First Search+1 |
| Letter Combinations of a Phone Number | Medium | 65.5% | 63.0% | Hash TableStringBacktracking |
| Kth Largest Element in an Array | Medium | 68.8% | 63.0% | ArrayDivide and ConquerSorting+2 |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.8% | 63.0% | TreeDepth-First SearchBinary Tree |
| Lowest Common Ancestor of a Binary Search Tree | Medium | 70.1% | 62.1% | TreeDepth-First SearchBinary Search Tree+1 |
| Isomorphic Strings | Easy | 48.1% | 62.1% | Hash TableString |
| Process Tasks Using Servers | Medium | 42.0% | 62.0% | ArrayHeap (Priority Queue) |
| Sort Transformed Array | Medium | 57.9% | 61.0% | ArrayMathTwo Pointers+1 |
| Symmetric Tree | Easy | 60.8% | 61.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Merge Intervals | Medium | 51.2% | 61.0% | ArraySorting |
| Kth Smallest Product of Two Sorted Arrays | Hard | 48.9% | 60.0% | ArrayBinary Search |
| Count Integers in Intervals | Hard | 35.7% | 60.0% | DesignSegment TreeOrdered Set |
| Valid Number | Hard | 22.6% | 60.0% | String |
| Valid Perfect Square | Easy | 44.7% | 60.0% | MathBinary Search |
| Longest Valid Parentheses | Hard | 38.1% | 59.2% | StringDynamic ProgrammingStack |
| Find Pivot Index | Easy | 62.1% | 59.1% | ArrayPrefix Sum |
| Closest Binary Search Tree Value II | Hard | 61.1% | 58.8% | Two PointersStackTree+4 |
| Second Minimum Node In a Binary Tree | Easy | 46.0% | 58.8% | TreeDepth-First SearchBinary Tree |
| Max Points on a Line | Hard | 30.3% | 58.8% | ArrayHash TableMath+1 |
| Repeated DNA Sequences | Medium | 52.9% | 57.6% | Hash TableStringBit Manipulation+3 |
| Evaluate Reverse Polish Notation | Medium | 57.1% | 57.6% | ArrayMathStack |
| House Robber | Medium | 52.9% | 57.6% | ArrayDynamic Programming |
| Longest Palindromic Subsequence | Medium | 65.1% | 56.3% | StringDynamic Programming |
| Can I Win | Medium | 31.0% | 56.3% | MathDynamic ProgrammingBit Manipulation+3 |
| LRU Cache | Medium | 46.8% | 56.3% | Hash TableLinked ListDesign+1 |
| Binary Tree Level Order Traversal | Medium | 72.2% | 56.3% | TreeBreadth-First SearchBinary Tree |
| Flatten Nested List Iterator | Medium | 65.6% | 54.9% | StackTreeDepth-First Search+3 |
| Shortest Word Distance III | Medium | 59.4% | 54.9% | ArrayString |
| Merge Two Sorted Lists | Easy | 68.0% | 54.9% | Linked ListRecursion |
| Permutations II | Medium | 63.0% | 54.9% | ArrayBacktrackingSorting |
| Permutations | Medium | 81.7% | 54.9% | ArrayBacktracking |
| Find K Pairs with Smallest Sums | Medium | 41.6% | 53.4% | ArrayHeap (Priority Queue) |
| Two Sum | Easy | 57.1% | 53.4% | ArrayHash Table |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.2% | 53.4% | TreeBreadth-First SearchBinary Tree |
| Merge k Sorted Lists | Hard | 58.9% | 53.4% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Palindromic Substrings | Medium | 72.6% | 53.4% | Two PointersStringDynamic Programming |
| Sparse Matrix Multiplication | Medium | 69.2% | 53.4% | ArrayHash TableMatrix |
| Sqrt(x) | Easy | 41.4% | 53.2% | MathBinary Search |
| Product of Array Except Self | Medium | 68.6% | 51.8% | ArrayPrefix Sum |
| Text Justification | Hard | 50.5% | 51.8% | ArrayStringSimulation |
| Design Bounded Blocking Queue | Medium | 73.6% | 51.0% | Concurrency |
| Find K Closest Elements | Medium | 49.4% | 50.0% | ArrayTwo PointersBinary Search+3 |
| Insert Delete GetRandom O(1) - Duplicates allowed | Hard | 36.4% | 50.0% | ArrayHash TableMath+2 |
| Find Largest Value in Each Tree Row | Medium | 66.3% | 50.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Maximize Total Tastiness of Purchased Fruits | Medium | 64.6% | 50.0% | ArrayDynamic Programming |
| Create Binary Tree From Descriptions | Medium | 81.7% | 50.0% | ArrayHash TableTree+1 |
| Sum of Square Numbers | Medium | 36.7% | 50.0% | MathTwo PointersBinary Search |
| Time to Cross a Bridge | Hard | 44.4% | 50.0% | ArrayHeap (Priority Queue)Simulation |
| Maximum Number of Non-overlapping Palindrome Substrings | Hard | 43.3% | 50.0% | Two PointersStringDynamic Programming+1 |
| Insert Interval | Medium | 44.8% | 50.0% | Array |
| Minimum Deletions to Make Array Divisible | Hard | 60.0% | 50.0% | ArrayMathSorting+2 |
| Two Sum III - Data structure design | Easy | 39.1% | 50.0% | ArrayHash TableTwo Pointers+2 |
| Binary Search Tree Iterator | Medium | 76.2% | 50.0% | StackTreeDesign+3 |
| Accounts Merge | Medium | 60.9% | 49.0% | ArrayHash TableString+4 |
| Paint House II | Hard | 56.9% | 49.0% | ArrayDynamic Programming |
| Max Area of Island | Medium | 73.8% | 48.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Design HashMap | Easy | 66.4% | 47.4% | ArrayHash TableLinked List+2 |
| Robot Bounded In Circle | Medium | 56.5% | 47.4% | MathStringSimulation |
| Edit Distance | Medium | 60.2% | 45.8% | StringDynamic Programming |
| Graph Valid Tree | Medium | 49.8% | 45.8% | Depth-First SearchBreadth-First SearchUnion Find+1 |
| Rotate List | Medium | 41.2% | 45.8% | Linked ListTwo Pointers |
| Valid Triangle Number | Medium | 56.7% | 45.8% | ArrayTwo PointersBinary Search+2 |
| Number of Divisible Triplet Sums | Medium | 67.5% | 45.3% | ArrayHash Table |
| Number of Connected Components in an Undirected Graph | Medium | 64.8% | 43.4% | Depth-First SearchBreadth-First SearchUnion Find+1 |
| Min Stack | Medium | 57.7% | 43.4% | StackDesign |
| Bulb Switcher | Medium | 55.5% | 40.9% | MathBrainteaser |
| Minimum Knight Moves | Medium | 41.8% | 40.9% | Breadth-First Search |
| Cinema Seat Allocation | Medium | 43.6% | 40.9% | ArrayHash TableGreedy+1 |
| Lowest Common Ancestor of a Binary Tree III | Medium | 82.9% | 40.9% | Hash TableTwo PointersTree+1 |
| Robot Room Cleaner | Hard | 77.9% | 40.9% | BacktrackingInteractive |
| Task Scheduler | Medium | 62.7% | 40.9% | ArrayHash TableGreedy+3 |
| Word Ladder II | Hard | 27.5% | 40.5% | Hash TableStringBacktracking+1 |
| Shuffle an Array | Medium | 59.6% | 40.5% | ArrayMathDesign+1 |
| Intersection of Two Linked Lists | Easy | 63.2% | 39.7% | Hash TableLinked ListTwo Pointers |
| Find Smallest Letter Greater Than Target | Easy | 58.9% | 39.7% | ArrayBinary Search |
| Possible Bipartition | Medium | 52.4% | 39.7% | Depth-First SearchBreadth-First SearchUnion Find+1 |
| Valid Parenthesis String | Medium | 39.8% | 39.7% | StringDynamic ProgrammingStack+1 |
| Valid Sudoku | Medium | 64.2% | 37.4% | ArrayHash TableMatrix |
| K Closest Points to Origin | Medium | 68.8% | 37.4% | ArrayMathDivide and Conquer+4 |
| Combination Sum | Medium | 76.1% | 37.1% | ArrayBacktracking |
| Longest Palindromic Substring | Medium | 37.4% | 37.1% | Two PointersStringDynamic Programming |
| Merge Sorted Array | Easy | 54.4% | 37.1% | ArrayTwo PointersSorting |
| Fizz Buzz | Easy | 75.3% | 33.0% | MathStringSimulation |
| Intersection of Two Arrays | Easy | 77.5% | 33.0% | ArrayHash TableTwo Pointers+2 |
| Integer to Roman | Medium | 70.5% | 33.0% | Hash TableMathString |
| Course Schedule II | Medium | 55.0% | 32.0% | Depth-First SearchBreadth-First SearchGraph+1 |
| Largest Color Value in a Directed Graph | Hard | 57.3% | 32.0% | Hash TableDynamic ProgrammingGraph+3 |
| Number of Visible People in a Queue | Hard | 72.4% | 32.0% | ArrayStackMonotonic Stack |
| Delete Node in a BST | Medium | 54.2% | 32.0% | TreeBinary Search TreeBinary Tree |
| Dot Product of Two Sparse Vectors | Medium | 89.9% | 32.0% | ArrayHash TableTwo Pointers+1 |
| Expression Add Operators | Hard | 42.8% | 32.0% | MathStringBacktracking |
| Koko Eating Bananas | Medium | 49.7% | 32.0% | ArrayBinary Search |
| Partition Labels | Medium | 81.8% | 32.0% | Hash TableTwo PointersString+1 |
| Random Pick with Weight | Medium | 48.9% | 32.0% | ArrayMathBinary Search+2 |
| 01 Matrix | Medium | 53.4% | 32.0% | ArrayDynamic ProgrammingBreadth-First Search+1 |
| Closest Leaf in a Binary Tree | Medium | 47.4% | 32.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Sum of All Odd Length Subarrays | Easy | 83.9% | 29.6% | ArrayMathPrefix Sum |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 29.6% | ArrayBinary SearchDynamic Programming+1 |
| Moving Average from Data Stream | Easy | 80.2% | 29.6% | ArrayDesignQueue+1 |
| Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | Medium | 72.3% | 29.6% | ArraySliding Window |
| House Robber IV | Medium | 64.8% | 27.8% | ArrayBinary SearchDynamic Programming+1 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 27.8% | Hash TableStringSliding Window |
| Diameter of Binary Tree | Easy | 65.1% | 27.8% | TreeDepth-First SearchBinary Tree |
| Median of Two Sorted Arrays | Hard | 46.0% | 27.8% | ArrayBinary SearchDivide and Conquer |
| House Robber II | Medium | 44.6% | 27.8% | ArrayDynamic Programming |
| Same Tree | Easy | 66.7% | 27.8% | TreeDepth-First SearchBreadth-First Search+1 |
| Next Permutation | Medium | 44.8% | 20.8% | ArrayTwo Pointers |
| Minimum Time to Type Word Using Special Typewriter | Easy | 78.4% | 20.8% | StringGreedy |
| Validate Binary Search Tree | Medium | 35.4% | 20.8% | TreeDepth-First SearchBinary Search Tree+1 |
| Design Add and Search Words Data Structure | Medium | 48.2% | 20.8% | StringDepth-First SearchDesign+1 |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 20.8% | ArrayDynamic Programming |
| Reorder List | Medium | 64.6% | 20.8% | Linked ListTwo PointersStack+1 |