| LRU Cache | Medium | 46.8% | 100.0% | Hash TableLinked ListDesign+1 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 86.8% | Hash TableStringSliding Window |
| Number of Islands | Medium | 63.8% | 83.4% | ArrayDepth-First SearchBreadth-First Search+2 |
| Two Sum | Easy | 57.1% | 82.8% | ArrayHash Table |
| Group Anagrams | Medium | 72.2% | 80.8% | ArrayHash TableString+1 |
| Top K Frequent Elements | Medium | 65.9% | 76.9% | ArrayHash TableDivide and Conquer+5 |
| Sliding Window Maximum | Hard | 48.5% | 76.1% | ArrayQueueSliding Window+2 |
| Valid Parentheses | Easy | 43.7% | 73.3% | StringStack |
| Merge k Sorted Lists | Hard | 58.9% | 73.3% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Merge Intervals | Medium | 51.2% | 70.0% | ArraySorting |
| Meeting Rooms II | Medium | 52.6% | 68.8% | ArrayTwo PointersGreedy+3 |
| Longest Palindromic Substring | Medium | 37.4% | 68.8% | Two PointersStringDynamic Programming |
| Spiral Matrix | Medium | 56.2% | 68.8% | ArrayMatrixSimulation |
| Minimum One Bit Operations to Make Integers Zero | Hard | 78.5% | 67.6% | MathDynamic ProgrammingBit Manipulation+2 |
| LFU Cache | Hard | 48.6% | 66.2% | Hash TableLinked ListDesign+1 |
| Search in Rotated Sorted Array | Medium | 44.1% | 66.2% | ArrayBinary Search |
| Asteroid Collision | Medium | 47.2% | 64.8% | ArrayStackSimulation |
| Remove All Adjacent Duplicates in String II | Medium | 60.9% | 63.2% | StringStack |
| Container With Most Water | Medium | 59.6% | 63.2% | ArrayTwo PointersGreedy |
| 3Sum | Medium | 38.6% | 63.2% | ArrayTwo PointersSorting |
| Reverse Linked List | Easy | 80.3% | 63.2% | Linked ListRecursion |
| Trapping Rain Water | Hard | 66.8% | 61.5% | ArrayTwo PointersDynamic Programming+2 |
| Longest Consecutive Sequence | Medium | 47.0% | 61.5% | ArrayHash TableUnion-Find |
| Min Stack | Medium | 57.7% | 61.5% | StackDesign |
| Minimum Absolute Difference | Easy | 75.0% | 61.5% | ArraySorting |
| Valid Anagram | Easy | 67.8% | 59.7% | Hash TableStringSorting |
| Rotting Oranges | Medium | 58.2% | 59.7% | ArrayBreadth-First SearchMatrix |
| Find Valid Pair of Adjacent Digits in String | Easy | 60.6% | 59.7% | Hash TableStringCounting |
| Maximum Subarray | Medium | 53.0% | 59.7% | ArrayDivide and ConquerDynamic Programming |
| Roman to Integer | Easy | 66.3% | 59.7% | Hash TableMathString |
| Count Pairs Of Similar Strings | Easy | 73.6% | 59.7% | ArrayHash TableString+2 |
| Maximize Value of Function in a Ball Passing Game | Hard | 30.4% | 59.7% | ArrayDynamic ProgrammingBit Manipulation |
| Koko Eating Bananas | Medium | 49.7% | 57.7% | ArrayBinary Search |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 57.7% | ArrayDynamic Programming |
| Binary Tree Right Side View | Medium | 69.5% | 57.7% | TreeDepth-First SearchBreadth-First Search+1 |
| Design Authentication Manager | Medium | 58.4% | 57.7% | Hash TableLinked ListDesign+1 |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.8% | 57.7% | TreeDepth-First SearchBinary Tree |
| Generate Parentheses | Medium | 78.3% | 57.7% | StringDynamic ProgrammingBacktracking |
| Decode String | Medium | 62.3% | 57.7% | StringStackRecursion |
| All Ancestors of a Node in a Directed Acyclic Graph | Medium | 62.1% | 57.7% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Lucky Numbers in a Matrix | Easy | 80.0% | 57.7% | ArrayMatrix |
| Count Ways To Build Good Strings | Medium | 59.0% | 57.7% | Dynamic Programming |
| Count the Number of Houses at a Certain Distance I | Medium | 57.3% | 57.7% | Breadth-First SearchGraph TheoryPrefix Sum |
| Minimize Length of Array Using Operations | Medium | 35.7% | 57.7% | ArrayMathGreedy+1 |
| Count the Number of Houses at a Certain Distance II | Hard | 23.7% | 57.7% | Graph TheoryPrefix Sum |
| HTML Entity Parser | Medium | 50.3% | 57.7% | Hash TableString |
| Count Distinct Numbers on Board | Easy | 61.7% | 57.7% | ArrayHash TableMath+1 |
| Count Ways to Group Overlapping Ranges | Medium | 39.0% | 57.7% | ArraySorting |
| Course Schedule | Medium | 50.8% | 55.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Longest Common Prefix | Easy | 47.1% | 55.5% | ArrayStringTrie |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.2% | 55.5% | TreeBreadth-First SearchBinary Tree |
| Find Median from Data Stream | Hard | 54.2% | 55.5% | Two PointersDesignSorting+2 |
| Sort Colors | Medium | 69.2% | 55.5% | ArrayTwo PointersSorting |
| Maximum Number of Events That Can Be Attended | Medium | 38.9% | 55.5% | ArrayGreedySorting+1 |
| Median of Two Sorted Arrays | Hard | 46.0% | 55.5% | ArrayBinary SearchDivide and Conquer |
| Word Squares II | Medium | 54.9% | 55.5% | ArrayStringBacktracking+2 |
| Diameter of Binary Tree | Easy | 65.1% | 53.1% | TreeDepth-First SearchBinary Tree |
| Coin Change | Medium | 48.0% | 53.1% | ArrayDynamic ProgrammingBreadth-First Search |
| Zigzag Conversion | Medium | 53.6% | 53.1% | String |
| First Missing Positive | Hard | 42.5% | 53.1% | ArrayHash Table |
| Kth Largest Element in an Array | Medium | 68.8% | 53.1% | ArrayDivide and ConquerSorting+2 |
| Delete Node in a BST | Medium | 54.2% | 53.1% | TreeBinary Search TreeBinary Tree |
| Contiguous Array | Medium | 50.8% | 53.1% | ArrayHash TablePrefix Sum |
| Unique Binary Search Trees | Medium | 63.3% | 53.1% | MathDynamic ProgrammingTree+2 |
| Simplify Path | Medium | 50.0% | 53.1% | StringStack |
| Restore IP Addresses | Medium | 55.3% | 53.1% | StringBacktracking |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 53.1% | Hash TableStringDesign+1 |
| Time Based Key-Value Store | Medium | 49.7% | 50.3% | Hash TableStringBinary Search+1 |
| Copy List with Random Pointer | Medium | 62.4% | 50.3% | Hash TableLinked List |
| Majority Element | Easy | 66.1% | 50.3% | ArrayHash TableDivide and Conquer+2 |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 50.3% | ArrayHash TableMath+2 |
| Binary Tree Level Order Traversal | Medium | 72.2% | 50.3% | TreeBreadth-First SearchBinary Tree |
| Degree of an Array | Easy | 58.2% | 50.3% | ArrayHash Table |
| Kth Smallest Element in a BST | Medium | 76.5% | 50.3% | TreeDepth-First SearchBinary Search Tree+1 |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 50.3% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Task Scheduler | Medium | 62.7% | 50.3% | ArrayHash TableGreedy+3 |
| Count the Number of Infection Sequences | Hard | 37.2% | 50.3% | ArrayMathCombinatorics |
| Product of Array Except Self | Medium | 68.6% | 50.3% | ArrayPrefix Sum |
| Logger Rate Limiter | Easy | 76.8% | 50.3% | Hash TableDesignData Stream |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% | 50.3% | Hash TableTreeDepth-First Search+3 |
| Word Ladder | Hard | 44.9% | 50.3% | Hash TableStringBreadth-First Search |
| Minimum Window Substring | Hard | 47.0% | 47.1% | Hash TableStringSliding Window |
| Longest Mountain in Array | Medium | 41.9% | 47.1% | ArrayTwo PointersDynamic Programming+1 |
| Merge In Between Linked Lists | Medium | 82.9% | 47.1% | Linked List |
| Diagonal Traverse | Medium | 67.0% | 47.1% | ArrayMatrixSimulation |
| Letter Combinations of a Phone Number | Medium | 65.5% | 47.1% | Hash TableStringBacktracking |
| Find First and Last Position of Element in Sorted Array | Medium | 48.4% | 47.1% | ArrayBinary Search |
| Search a 2D Matrix | Medium | 53.6% | 47.1% | ArrayBinary SearchMatrix |
| Gas Station | Medium | 47.5% | 47.1% | ArrayGreedy |
| Word Break II | Hard | 55.1% | 47.1% | ArrayHash TableString+4 |
| Move Zeroes | Easy | 63.6% | 47.1% | ArrayTwo Pointers |
| Longest Increasing Subsequence | Medium | 59.1% | 47.1% | ArrayBinary SearchDynamic Programming |
| String Compression | Medium | 59.6% | 47.1% | Two PointersString |
| Subarray Sum Equals K | Medium | 46.8% | 47.1% | ArrayHash TablePrefix Sum |
| Design In-Memory File System | Hard | 48.4% | 47.1% | Hash TableStringDesign+2 |
| Integer to Roman | Medium | 70.5% | 47.1% | Hash TableMathString |
| Maximum Profit From Trading Stocks | Medium | 48.0% | 47.1% | ArrayDynamic Programming |
| N-Queens | Hard | 75.0% | 47.1% | ArrayBacktracking |
| Valid Palindrome | Easy | 52.8% | 47.1% | Two PointersString |
| Palindromic Substrings | Medium | 72.6% | 47.1% | Two PointersStringDynamic Programming |
| Pour Water | Medium | 48.5% | 47.1% | ArraySimulation |
| Validate Binary Search Tree | Medium | 35.4% | 47.1% | TreeDepth-First SearchBinary Search Tree+1 |
| Maximal Square | Medium | 50.0% | 47.1% | ArrayDynamic ProgrammingMatrix |
| Search a 2D Matrix II | Medium | 56.9% | 47.1% | ArrayBinary SearchDivide and Conquer+1 |
| Reverse Vowels of a String | Easy | 60.7% | 47.1% | Two PointersString |
| Max Area of Island | Medium | 73.8% | 43.3% | ArrayDepth-First SearchBreadth-First Search+2 |
| Add Two Numbers | Medium | 48.0% | 43.3% | Linked ListMathRecursion |
| Set Matrix Zeroes | Medium | 62.5% | 43.3% | ArrayHash TableMatrix |
| Word Search | Medium | 46.9% | 43.3% | ArrayStringBacktracking+2 |
| Meeting Rooms | Easy | 59.3% | 43.3% | ArraySorting |
| Top K Frequent Words | Medium | 60.0% | 43.3% | ArrayHash TableString+5 |
| Number of Distinct Islands | Medium | 62.7% | 43.3% | ArrayHash TableDepth-First Search+5 |
| Largest Number | Medium | 42.6% | 43.3% | ArrayStringGreedy+1 |
| Reverse Words in a String | Medium | 55.6% | 43.3% | Two PointersString |
| Palindrome Number | Easy | 60.3% | 43.3% | Math |
| Next Permutation | Medium | 44.8% | 43.3% | ArrayTwo Pointers |
| Count Vowel Substrings of a String | Easy | 72.9% | 43.3% | Hash TableString |
| Number of Visible People in a Queue | Hard | 72.4% | 43.3% | ArrayStackMonotonic Stack |
| Rotate Image | Medium | 79.4% | 43.3% | ArrayMathMatrix |
| Jump Game | Medium | 40.5% | 43.3% | ArrayDynamic ProgrammingGreedy |
| Course Schedule II | Medium | 55.0% | 43.3% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Reorganize String | Medium | 56.8% | 43.3% | Hash TableStringGreedy+3 |
| Design HashMap | Easy | 66.4% | 43.3% | ArrayHash TableLinked List+2 |
| Pairs of Songs With Total Durations Divisible by 60 | Medium | 53.4% | 43.3% | ArrayHash TableCounting |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 43.3% | ArrayBinary SearchDynamic Programming+1 |
| Search Suggestions System | Medium | 65.1% | 43.3% | ArrayStringBinary Search+3 |
| Second Highest Salary | Medium | 46.4% | 43.3% | Database |
| Single Element in a Sorted Array | Medium | 59.2% | 43.3% | ArrayBinary Search |
| Consecutive Numbers Sum | Hard | 42.6% | 43.3% | MathEnumeration |
| Find Leaves of Binary Tree | Medium | 81.3% | 38.7% | TreeDepth-First SearchBinary Tree |
| Kth Smallest Element in a Sorted Matrix | Medium | 64.4% | 38.7% | ArrayBinary SearchSorting+2 |
| Merge Two Sorted Lists | Easy | 68.0% | 38.7% | Linked ListRecursion |
| Remove Duplicates from Sorted Array | Easy | 62.3% | 38.7% | ArrayTwo Pointers |
| Permutations | Medium | 81.7% | 38.7% | ArrayBacktracking |
| Linked List Cycle | Easy | 53.9% | 38.7% | Hash TableLinked ListTwo Pointers |
| Capacity To Ship Packages Within D Days | Medium | 73.5% | 38.7% | ArrayBinary Search |
| Combination Sum II | Medium | 59.0% | 38.7% | ArrayBacktracking |
| Rotate List | Medium | 41.2% | 38.7% | Linked ListTwo Pointers |
| Sort an Array | Medium | 55.9% | 38.7% | ArrayDivide and ConquerSorting+5 |
| Maximum Good People Based on Statements | Hard | 52.3% | 38.7% | ArrayBacktrackingBit Manipulation+1 |
| Find the Smallest Divisor Given a Threshold | Medium | 65.5% | 38.7% | ArrayBinary Search |
| House Robber | Medium | 52.9% | 38.7% | ArrayDynamic Programming |
| Find the Winner of the Circular Game | Medium | 82.2% | 38.7% | ArrayMathRecursion+2 |
| Permutation in String | Medium | 48.5% | 38.7% | Hash TableTwo PointersString+1 |
| Divide Two Integers | Medium | 19.4% | 38.7% | MathBit Manipulation |
| Surrounded Regions | Medium | 44.8% | 38.7% | ArrayDepth-First SearchBreadth-First Search+2 |
| Delete Node in a Linked List | Medium | 83.6% | 38.7% | Linked List |
| Kill Process | Medium | 70.3% | 38.7% | ArrayHash TableTree+2 |
| Subarray Product Less Than K | Medium | 53.9% | 38.7% | ArrayBinary SearchSliding Window+1 |
| Reverse Integer | Medium | 31.5% | 38.7% | Math |
| Minimum Array Sum | Medium | 31.0% | 38.7% | ArrayDynamic Programming |
| Maximum Number of Non-overlapping Palindrome Substrings | Hard | 43.3% | 38.7% | Two PointersStringDynamic Programming+1 |
| Open the Lock | Medium | 61.2% | 32.9% | ArrayHash TableString+1 |
| Sum Root to Leaf Numbers | Medium | 69.6% | 32.9% | TreeDepth-First SearchBinary Tree |
| Invalid Transactions | Medium | 32.1% | 32.9% | ArrayHash TableString+1 |
| Distance to a Cycle in Undirected Graph | Hard | 74.0% | 32.9% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Two Sum II - Input Array Is Sorted | Medium | 64.6% | 32.9% | ArrayTwo PointersBinary Search |
| Find K Pairs with Smallest Sums | Medium | 41.6% | 32.9% | ArrayHeap (Priority Queue) |
| Pow(x, n) | Medium | 38.3% | 32.9% | MathRecursion |
| Merge Sorted Array | Easy | 54.4% | 32.9% | ArrayTwo PointersSorting |
| Populating Next Right Pointers in Each Node | Medium | 66.9% | 32.9% | Linked ListTreeDepth-First Search+2 |
| Minimum Size Subarray Sum | Medium | 51.1% | 32.9% | ArrayBinary SearchSliding Window+1 |
| Basic Calculator | Hard | 46.6% | 32.9% | MathStringStack+1 |
| Integer to English Words | Hard | 34.8% | 32.9% | MathStringRecursion |
| First Unique Character in a String | Easy | 65.1% | 32.9% | Hash TableStringQueue+1 |
| Island Perimeter | Easy | 74.3% | 32.9% | ArrayDepth-First SearchBreadth-First Search+1 |
| Rearranging Fruits | Hard | 57.5% | 32.9% | ArrayHash TableGreedy+1 |
| Word Break | Medium | 49.1% | 32.9% | ArrayHash TableString+3 |
| Isomorphic Strings | Easy | 48.1% | 32.9% | Hash TableString |
| Remove Duplicates from Sorted List | Easy | 56.3% | 32.9% | Linked List |
| Contains Duplicate | Easy | 64.1% | 32.9% | ArrayHash TableSorting |
| Distinct Subsequences | Hard | 51.5% | 32.9% | StringDynamic Programming |
| Flatten Binary Tree to Linked List | Medium | 70.2% | 32.9% | Linked ListStackTree+2 |
| Next Greater Element I | Easy | 75.8% | 32.9% | ArrayHash TableStack+1 |
| Reformat Date | Easy | 68.3% | 32.9% | String |
| Daily Temperatures | Medium | 68.4% | 32.9% | ArrayStackMonotonic Stack |
| Remove All Adjacent Duplicates In String | Easy | 72.8% | 32.9% | StringStack |
| Longest Substring with At Most K Distinct Characters | Medium | 49.9% | 32.9% | Hash TableStringSliding Window |
| Calculate Amount Paid in Taxes | Easy | 69.0% | 32.9% | ArraySimulation |
| Non-overlapping Intervals | Medium | 56.7% | 32.9% | ArrayDynamic ProgrammingGreedy+1 |
| Regular Expression Matching | Hard | 30.5% | 32.9% | StringDynamic ProgrammingRecursion |
| Triangle | Medium | 59.9% | 32.9% | ArrayDynamic Programming |
| All Nodes Distance K in Binary Tree | Medium | 67.4% | 32.9% | Hash TableTreeDepth-First Search+2 |
| Minimum Cost to Make Array Equal | Hard | 46.7% | 32.9% | ArrayBinary SearchGreedy+2 |
| Clone Graph | Medium | 64.7% | 32.9% | Hash TableDepth-First SearchBreadth-First Search+1 |
| Basic Calculator II | Medium | 46.7% | 32.9% | MathStringStack |
| Candy | Hard | 48.0% | 32.9% | ArrayGreedy |
| Maximum Earnings From Taxi | Medium | 46.2% | 32.9% | ArrayHash TableBinary Search+2 |
| Keys and Rooms | Medium | 75.5% | 32.9% | Depth-First SearchBreadth-First SearchGraph Theory |
| Rotate String | Easy | 65.1% | 32.9% | StringString Matching |
| Reverse Substrings Between Each Pair of Parentheses | Medium | 71.9% | 32.9% | StringStack |
| Valid Sudoku | Medium | 64.2% | 32.9% | ArrayHash TableMatrix |
| Frog Jump | Hard | 47.1% | 32.9% | ArrayDynamic Programming |
| Climbing Stairs | Easy | 53.9% | 32.9% | MathDynamic ProgrammingMemoization |
| Sort List | Medium | 63.9% | 32.9% | Linked ListTwo PointersDivide and Conquer+2 |
| Reverse Linked List II | Medium | 51.0% | 32.9% | Linked List |
| Count Binary Substrings | Easy | 70.3% | 32.9% | Two PointersString |
| Meeting Rooms III | Hard | 51.6% | 32.9% | ArrayHash TableSorting+2 |
| Sqrt(x) | Easy | 41.4% | 32.9% | MathBinary Search |
| Minimum Remove to Make Valid Parentheses | Medium | 71.3% | 32.9% | StringStack |
| Number of Music Playlists | Hard | 60.0% | 32.9% | MathDynamic ProgrammingCombinatorics |
| Add Strings | Easy | 52.1% | 32.9% | MathStringSimulation |
| Find Minimum in Rotated Sorted Array | Medium | 53.8% | 32.9% | ArrayBinary Search |
| Palindrome Linked List | Easy | 57.5% | 32.9% | Linked ListTwo PointersStack+1 |
| Decrypt String from Alphabet to Integer Mapping | Easy | 80.6% | 32.9% | String |
| Number of Closed Islands | Medium | 67.0% | 32.9% | ArrayDepth-First SearchBreadth-First Search+2 |
| Convert Binary Number in a Linked List to Integer | Easy | 82.3% | 32.9% | Linked ListMath |
| Binary Tree Level Order Traversal II | Medium | 67.7% | 24.9% | TreeBreadth-First SearchBinary Tree |
| Minimum Cost Path with Edge Reversals | Medium | 61.8% | 24.9% | Graph TheoryHeap (Priority Queue)Shortest Path |
| Avoid Flood in The City | Medium | 39.0% | 24.9% | ArrayHash TableBinary Search+2 |
| Jump Game II | Medium | 42.5% | 24.9% | ArrayDynamic ProgrammingGreedy |
| Insert Interval | Medium | 44.8% | 24.9% | Array |
| Find the Duplicate Number | Medium | 64.0% | 24.9% | ArrayTwo PointersBinary Search+1 |
| Backspace String Compare | Easy | 49.8% | 24.9% | Two PointersStringStack+1 |
| Max Consecutive Ones III | Medium | 67.3% | 24.9% | ArrayBinary SearchSliding Window+1 |
| Rotate Array | Medium | 44.5% | 24.9% | ArrayMathTwo Pointers |
| Text Justification | Hard | 50.5% | 24.9% | ArrayStringSimulation |
| Sort Array by Increasing Frequency | Easy | 80.7% | 24.9% | ArrayHash TableSorting |
| Find Peak Element | Medium | 46.8% | 24.9% | ArrayBinary Search |
| Path Sum II | Medium | 61.8% | 24.9% | BacktrackingTreeDepth-First Search+1 |
| Edit Distance | Medium | 60.2% | 24.9% | StringDynamic Programming |
| Count Servers that Communicate | Medium | 73.5% | 24.9% | ArrayDepth-First SearchBreadth-First Search+3 |
| Last Stone Weight | Easy | 66.3% | 24.9% | ArrayHeap (Priority Queue) |
| Minimum Cost to Cut a Stick | Hard | 62.8% | 24.9% | ArrayDynamic ProgrammingSorting |
| Swapping Nodes in a Linked List | Medium | 69.2% | 24.9% | Linked ListTwo Pointers |
| Max Stack | Hard | 45.9% | 24.9% | Linked ListStackDesign+2 |
| Split Array Largest Sum | Hard | 59.9% | 24.9% | ArrayBinary SearchDynamic Programming+2 |
| Minimum Operations to Halve Array Sum | Medium | 50.0% | 24.9% | ArrayGreedyHeap (Priority Queue) |
| Remove Linked List Elements | Easy | 53.9% | 24.9% | Linked ListRecursion |
| Binary Search | Easy | 60.5% | 24.9% | ArrayBinary Search |
| Remove Duplicates from Sorted List II | Medium | 51.3% | 24.9% | Linked ListTwo Pointers |
| Linked List Cycle II | Medium | 57.3% | 24.9% | Hash TableLinked ListTwo Pointers |
| Fraction to Recurring Decimal | Medium | 30.6% | 24.9% | Hash TableMathString |
| Count of Range Sum | Hard | 38.3% | 24.9% | ArrayBinary SearchDivide and Conquer+4 |
| My Calendar I | Medium | 58.2% | 24.9% | ArrayBinary SearchDesign+2 |
| Invert Binary Tree | Easy | 79.8% | 24.9% | TreeDepth-First SearchBreadth-First Search+1 |
| Letter Tile Possibilities | Medium | 83.5% | 24.9% | Hash TableStringBacktracking+1 |
| Swap Nodes in Pairs | Medium | 69.0% | 24.9% | Linked ListRecursion |
| Maximize Greatness of an Array | Medium | 61.3% | 24.9% | ArrayTwo PointersGreedy+1 |
| Maximum Candies Allocated to K Children | Medium | 49.9% | 24.9% | ArrayBinary Search |
| Find All Duplicates in an Array | Medium | 76.8% | 24.9% | ArrayHash TableSorting |
| Merge Nodes in Between Zeros | Medium | 89.7% | 24.9% | Linked ListSimulation |
| Basic Calculator III | Hard | 53.2% | 24.9% | MathStringStack+1 |
| Cache With Time Limit | Medium | 76.0% | 24.9% | |
| Maximum Employees to Be Invited to a Meeting | Hard | 61.8% | 24.9% | ArrayDynamic ProgrammingDepth-First Search+2 |
| Plates Between Candles | Medium | 47.3% | 24.9% | ArrayStringBinary Search+1 |
| Create Maximum Number | Hard | 34.7% | 24.9% | ArrayTwo PointersStack+2 |
| The kth Factor of n | Medium | 70.2% | 24.9% | MathNumber Theory |
| Nested List Weight Sum | Medium | 85.9% | 24.9% | Depth-First SearchBreadth-First Search |
| Count and Say | Medium | 62.3% | 24.9% | String |
| Remove K Digits | Medium | 36.4% | 24.9% | StringStackGreedy+1 |
| Subsets | Medium | 82.1% | 24.9% | ArrayBacktrackingBit Manipulation |
| Minimum Sideway Jumps | Medium | 51.5% | 24.9% | ArrayDynamic ProgrammingGreedy |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 24.9% | StringTreeDepth-First Search+3 |
| Encode and Decode Strings | Medium | 51.2% | 24.9% | ArrayStringDesign |
| Largest Divisible Subset | Medium | 49.4% | 24.9% | ArrayMathDynamic Programming+1 |
| Word Search II | Hard | 38.1% | 24.9% | ArrayStringBacktracking+2 |
| Multiply Strings | Medium | 43.6% | 24.9% | MathStringSimulation |
| Sparse Matrix Multiplication | Medium | 69.2% | 24.9% | ArrayHash TableMatrix |
| Next Greater Element III | Medium | 35.2% | 24.9% | MathTwo PointersString |
| Remove Nth Node From End of List | Medium | 51.0% | 24.9% | Linked ListTwo Pointers |
| Greatest Common Divisor of Strings | Easy | 53.4% | 24.9% | MathString |
| Decode Ways | Medium | 37.6% | 24.9% | StringDynamic Programming |
| Minimize Maximum of Array | Medium | 46.5% | 24.9% | ArrayBinary SearchDynamic Programming+2 |
| 3Sum Smaller | Medium | 51.3% | 24.9% | ArrayTwo PointersBinary Search+1 |
| Generate Schedule | Medium | | 24.9% | ArrayMathGreedy |
| Merge Strings Alternately | Easy | 82.1% | 24.9% | Two PointersString |
| Count Number of Nice Subarrays | Medium | 74.8% | 24.9% | ArrayHash TableMath+2 |
| Minimum Cost Homecoming of a Robot in a Grid | Medium | 51.6% | 24.9% | ArrayGreedy |
| Missing Number | Easy | 71.7% | 24.9% | ArrayHash TableMath+3 |
| Evaluate Reverse Polish Notation | Medium | 57.1% | 24.9% | ArrayMathStack |
| Boundary of Binary Tree | Medium | 47.9% | 24.9% | TreeDepth-First SearchBinary Tree |
| Design Add and Search Words Data Structure | Medium | 48.2% | 24.9% | StringDepth-First SearchDesign+1 |
| Minimum Number of Steps to Make Two Strings Anagram | Medium | 82.5% | 24.9% | Hash TableStringCounting |
| Design Circular Queue | Medium | 54.0% | 24.9% | ArrayLinked ListDesign+1 |
| Water and Jug Problem | Medium | 45.0% | 24.9% | MathDepth-First SearchBreadth-First Search |
| Number of Valid Words in a Sentence | Easy | 31.0% | 24.9% | String |
| Minimum Number of Increments on Subarrays to Form a Target Array | Hard | 78.1% | 24.9% | ArrayDynamic ProgrammingStack+2 |
| Collect Coins in a Tree | Hard | 39.7% | 24.9% | ArrayTreeGraph Theory+1 |
| K Closest Points to Origin | Medium | 68.8% | 24.9% | ArrayMathDivide and Conquer+4 |
| Subarrays with K Different Integers | Hard | 67.6% | 24.9% | ArrayHash TableSliding Window+1 |
| Add Two Numbers II | Medium | 62.4% | 24.9% | Linked ListMathStack |
| Kth Missing Positive Number | Easy | 63.2% | 24.9% | ArrayBinary Search |
| Maximum Size Subarray Sum Equals k | Medium | 50.8% | 24.9% | ArrayHash TablePrefix Sum |
| Minimum Insertion Steps to Make a String Palindrome | Hard | 73.7% | 24.9% | StringDynamic Programming |
| Trapping Rain Water II | Hard | 64.0% | 24.9% | ArrayBreadth-First SearchHeap (Priority Queue)+1 |
| Find in Mountain Array | Hard | 41.2% | 24.9% | ArrayBinary SearchInteractive |
| Single Number III | Medium | 70.4% | 24.9% | ArrayBit Manipulation |
| Largest Rectangle in Histogram | Hard | 49.4% | 24.9% | ArrayStackMonotonic Stack |
| Can Place Flowers | Easy | 29.1% | 24.9% | ArrayGreedy |
| Counting Bits | Easy | 80.4% | 24.9% | Dynamic ProgrammingBit Manipulation |
| Merge Operations to Turn Array Into a Palindrome | Medium | 68.9% | 24.9% | ArrayTwo PointersGreedy |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 57.3% | 24.9% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+1 |
| Wildcard Matching | Hard | 31.4% | 24.9% | StringDynamic ProgrammingGreedy+1 |
| Sudoku Solver | Hard | 65.4% | 24.9% | ArrayHash TableBacktracking+1 |
| Maximum Depth of Binary Tree | Easy | 77.9% | 24.9% | TreeDepth-First SearchBreadth-First Search+1 |
| Remove Invalid Parentheses | Hard | 49.8% | 24.9% | StringBacktrackingBreadth-First Search |
| Least Number of Unique Integers after K Removals | Medium | 63.7% | 24.9% | ArrayHash TableGreedy+2 |
| Longest Valid Parentheses | Hard | 38.1% | 24.9% | StringDynamic ProgrammingStack |
| Combination Sum | Medium | 76.1% | 24.9% | ArrayBacktracking |
| Validate IP Address | Medium | 28.2% | 24.9% | String |
| Design File System | Medium | 65.1% | 24.9% | Hash TableStringDesign+1 |
| Redundant Connection | Medium | 67.3% | 24.9% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Minimum Knight Moves | Medium | 41.8% | 24.9% | Breadth-First Search |
| Bus Routes | Hard | 47.1% | 24.9% | ArrayHash TableBreadth-First Search |
| Happy Number | Easy | 59.3% | 24.9% | Hash TableMathTwo Pointers |
| Flood Fill | Easy | 67.9% | 24.9% | ArrayDepth-First SearchBreadth-First Search+1 |
| Percentage of Users Attended a Contest | Easy | 60.0% | 24.9% | Database |
| Reverse Nodes in k-Group | Hard | 65.4% | 24.9% | Linked ListRecursion |
| Design Hit Counter | Medium | 69.6% | 24.9% | ArrayBinary SearchDesign+2 |
| Simple Bank System | Medium | 69.8% | 24.9% | ArrayHash TableDesign+1 |
| Find Minimum Diameter After Merging Two Trees | Hard | 57.1% | 24.9% | TreeDepth-First SearchBreadth-First Search+1 |
| Path Sum III | Medium | 46.3% | 24.9% | TreeDepth-First SearchBinary Tree |
| Monthly Transactions I | Medium | 58.9% | 24.9% | Database |