| LRU Cache | Medium | 46.8% | 100.0% | Hash TableLinked ListDesign+1 |
| Number of Islands | Medium | 63.8% | 100.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 87.5% | Hash TableStringSliding Window |
| Trapping Rain Water | Hard | 66.8% | 87.5% | ArrayTwo PointersDynamic Programming+2 |
| Merge Intervals | Medium | 51.1% | 87.5% | ArraySorting |
| Course Schedule | Medium | 50.8% | 87.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Course Schedule II | Medium | 55.0% | 87.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Meeting Rooms II | Medium | 52.5% | 87.5% | |
| Longest Increasing Subsequence | Medium | 59.0% | 87.5% | ArrayBinary SearchDynamic Programming |
| Number of Distinct Islands | Medium | 62.7% | 87.5% | |
| Subarray With Elements Greater Than Varying Threshold | Hard | 45.2% | 87.5% | ArrayStackUnion-Find+1 |
| Two Sum | Easy | 57.1% | 75.0% | ArrayHash Table |
| Longest Palindromic Substring | Medium | 37.3% | 75.0% | Two PointersStringDynamic Programming |
| 3Sum | Medium | 38.6% | 75.0% | ArrayTwo PointersSorting |
| Merge k Sorted Lists | Hard | 58.8% | 75.0% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Search in Rotated Sorted Array | Medium | 44.1% | 75.0% | ArrayBinary Search |
| N-Queens | Hard | 74.9% | 75.0% | ArrayBacktracking |
| Spiral Matrix | Medium | 56.1% | 75.0% | ArrayMatrixSimulation |
| Text Justification | Hard | 50.4% | 75.0% | ArrayStringSimulation |
| Sqrt(x) | Easy | 41.4% | 75.0% | MathBinary Search |
| Minimum Window Substring | Hard | 46.9% | 75.0% | Hash TableStringSliding Window |
| Word Search | Medium | 46.8% | 75.0% | ArrayStringBacktracking+2 |
| Restore IP Addresses | Medium | 55.3% | 75.0% | StringBacktracking |
| House Robber | Medium | 52.9% | 75.0% | ArrayDynamic Programming |
| Kth Largest Element in an Array | Medium | 68.8% | 75.0% | ArrayDivide and ConquerSorting+2 |
| Basic Calculator II | Medium | 46.6% | 75.0% | MathStringStack |
| Coin Change | Medium | 47.9% | 75.0% | ArrayDynamic ProgrammingBreadth-First Search |
| Top K Frequent Elements | Medium | 65.8% | 75.0% | ArrayHash TableDivide and Conquer+5 |
| Decode String | Medium | 62.2% | 75.0% | StringStackRecursion |
| Subarray Sum Equals K | Medium | 46.8% | 75.0% | ArrayHash TablePrefix Sum |
| Maximum Swap | Medium | 51.9% | 75.0% | MathGreedy |
| Basic Calculator III | Hard | 53.1% | 75.0% | |
| Making A Large Island | Hard | 56.3% | 75.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Minimum Swaps to Group All 1's Together | Medium | 61.2% | 75.0% | |
| Valid Parentheses | Easy | 43.7% | 62.5% | StringStack |
| Generate Parentheses | Medium | 78.2% | 62.5% | StringDynamic ProgrammingBacktracking |
| Combination Sum | Medium | 76.1% | 62.5% | ArrayBacktracking |
| Permutations | Medium | 81.6% | 62.5% | ArrayBacktracking |
| Group Anagrams | Medium | 72.2% | 62.5% | ArrayHash TableString+1 |
| Jump Game | Medium | 40.5% | 62.5% | ArrayDynamic ProgrammingGreedy |
| Edit Distance | Medium | 60.1% | 62.5% | StringDynamic Programming |
| Sort Colors | Medium | 69.1% | 62.5% | ArrayTwo PointersSorting |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | 68.3% | 62.5% | ArrayHash TableDivide and Conquer+2 |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 62.5% | ArrayDynamic Programming |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 62.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Word Ladder | Hard | 44.9% | 62.5% | Hash TableStringBreadth-First Search |
| Longest Consecutive Sequence | Medium | 47.0% | 62.5% | ArrayHash TableUnion-Find |
| Word Break II | Hard | 55.1% | 62.5% | ArrayHash TableString+4 |
| Find Peak Element | Medium | 46.8% | 62.5% | ArrayBinary Search |
| Binary Tree Right Side View | Medium | 69.5% | 62.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Count the Hidden Sequences | Medium | 56.7% | 62.5% | ArrayPrefix Sum |
| Reverse Linked List | Easy | 80.2% | 62.5% | Linked ListRecursion |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.7% | 62.5% | TreeDepth-First SearchBinary Tree |
| Serialize and Deserialize Binary Tree | Hard | 60.3% | 62.5% | StringTreeDepth-First Search+3 |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 62.5% | ArrayDynamic ProgrammingDepth-First Search+5 |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 62.5% | ArrayHash TableMath+2 |
| Longest Substring with At Least K Repeating Characters | Medium | 46.0% | 62.5% | Hash TableStringDivide and Conquer+1 |
| Frog Jump | Hard | 47.1% | 62.5% | ArrayDynamic Programming |
| Add Strings | Easy | 52.1% | 62.5% | MathStringSimulation |
| Meeting Rooms III | Hard | 51.7% | 62.5% | ArrayHash TableSorting+2 |
| Length of the Longest Alphabetical Continuous Substring | Medium | 60.3% | 62.5% | String |
| Most Popular Video Creator | Medium | 45.2% | 62.5% | ArrayHash TableString+2 |
| Closest Prime Numbers in Range | Medium | 51.7% | 62.5% | MathNumber Theory |
| Design In-Memory File System | Hard | 48.4% | 62.5% | |
| Find the Score of All Prefixes of an Array | Medium | 72.8% | 62.5% | ArrayPrefix Sum |
| Valid Parenthesis String | Medium | 39.8% | 62.5% | StringDynamic ProgrammingStack+1 |
| Max Area of Island | Medium | 73.8% | 62.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Asteroid Collision | Medium | 47.1% | 62.5% | ArrayStackSimulation |
| Daily Temperatures | Medium | 68.3% | 62.5% | ArrayStackMonotonic Stack |
| Reorganize String | Medium | 56.8% | 62.5% | Hash TableStringGreedy+3 |
| Count Complete Subarrays in an Array | Medium | 75.9% | 62.5% | ArrayHash TableSliding Window |
| Design HashMap | Easy | 66.4% | 62.5% | ArrayHash TableLinked List+2 |
| Bus Routes | Hard | 47.1% | 62.5% | ArrayHash TableBreadth-First Search |
| Minimum Moves to Pick K Ones | Hard | 21.5% | 62.5% | ArrayGreedySliding Window+1 |
| Longest Happy String | Medium | 65.5% | 62.5% | StringGreedyHeap (Priority Queue) |
| Shortest Path in a Grid with Obstacles Elimination | Hard | 46.1% | 62.5% | ArrayBreadth-First SearchMatrix |
| Maximum Value at a Given Index in a Bounded Array | Medium | 38.9% | 62.5% | MathBinary SearchGreedy |
| Incremental Memory Leak | Medium | 73.0% | 62.5% | MathSimulation |
| Word Search II | Hard | 38.1% | 62.5% | ArrayStringBacktracking+2 |
| Minimum Operations to Make Character Frequencies Equal | Hard | 26.4% | 62.5% | Hash TableStringDynamic Programming+2 |
| Minimum Cost Good Caption | Hard | 20.5% | 62.5% | StringDynamic Programming |
| Lexicographically Smallest Generated String | Hard | 31.5% | 62.5% | StringGreedyString Matching |
| Snapshot Array | Medium | 36.7% | 62.5% | ArrayHash TableBinary Search+1 |
| Regular Expression Matching | Hard | 30.4% | 50.0% | StringDynamic ProgrammingRecursion |
| Container With Most Water | Medium | 59.5% | 50.0% | ArrayTwo PointersGreedy |
| Longest Common Prefix | Easy | 47.1% | 50.0% | ArrayStringTrie |
| Reverse Nodes in k-Group | Hard | 65.3% | 50.0% | Linked ListRecursion |
| Find First and Last Position of Element in Sorted Array | Medium | 48.3% | 50.0% | ArrayBinary Search |
| Combination Sum II | Medium | 59.0% | 50.0% | ArrayBacktracking |
| Jump Game II | Medium | 42.4% | 50.0% | ArrayDynamic ProgrammingGreedy |
| Permutations II | Medium | 62.9% | 50.0% | ArrayBacktrackingSorting |
| Maximum Subarray | Medium | 53.0% | 50.0% | ArrayDivide and ConquerDynamic Programming |
| Climbing Stairs | Easy | 53.9% | 50.0% | MathDynamic ProgrammingMemoization |
| Simplify Path | Medium | 50.0% | 50.0% | StringStack |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.1% | 50.0% | TreeBreadth-First SearchBinary Tree |
| Best Time to Buy and Sell Stock II | Medium | 70.7% | 50.0% | ArrayDynamic ProgrammingGreedy |
| Reorder List | Medium | 64.6% | 50.0% | Linked ListTwo PointersStack+1 |
| Word Break | Medium | 49.1% | 50.0% | ArrayHash TableString+3 |
| Maximum Product Subarray | Medium | 36.0% | 50.0% | ArrayDynamic Programming |
| Find Minimum in Rotated Sorted Array | Medium | 53.8% | 50.0% | ArrayBinary Search |
| Longest Substring with At Most Two Distinct Characters | Medium | 57.0% | 50.0% | |
| Compare Version Numbers | Medium | 46.1% | 50.0% | Two PointersString |
| Minimum Size Subarray Sum | Medium | 51.0% | 50.0% | ArrayBinary SearchSliding Window+1 |
| Basic Calculator | Hard | 46.5% | 50.0% | MathStringStack+1 |
| Sliding Window Maximum | Hard | 48.4% | 50.0% | ArrayQueueSliding Window+2 |
| Meeting Rooms | Easy | 59.3% | 50.0% | |
| Alien Dictionary | Hard | 37.1% | 50.0% | |
| Move Zeroes | Easy | 63.5% | 50.0% | ArrayTwo Pointers |
| Walls and Gates | Medium | 63.8% | 50.0% | |
| Find Median from Data Stream | Hard | 54.2% | 50.0% | Two PointersDesignSorting+2 |
| Remove Invalid Parentheses | Hard | 49.8% | 50.0% | StringBacktrackingBreadth-First Search |
| Remove Duplicate Letters | Medium | 52.8% | 50.0% | StringStackGreedy+1 |
| Design Tic-Tac-Toe | Medium | 58.7% | 50.0% | |
| Rearrange String k Distance Apart | Hard | 39.5% | 50.0% | |
| Kth Smallest Element in a Sorted Matrix | Medium | 64.4% | 50.0% | ArrayBinary SearchSorting+2 |
| Evaluate Division | Medium | 64.0% | 50.0% | ArrayStringDepth-First Search+4 |
| Partition Equal Subset Sum | Medium | 49.2% | 50.0% | ArrayDynamic Programming |
| Pacific Atlantic Water Flow | Medium | 60.6% | 50.0% | ArrayDepth-First SearchBreadth-First Search+1 |
| Convert Binary Search Tree to Sorted Doubly Linked List | Medium | 65.6% | 50.0% | |
| Score of Parentheses | Medium | 63.6% | 50.0% | StringStack |
| Koko Eating Bananas | Medium | 49.7% | 50.0% | ArrayBinary Search |
| Random Pick with Weight | Medium | 48.9% | 50.0% | ArrayMathBinary Search+2 |
| Possible Bipartition | Medium | 52.3% | 50.0% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Sum of Subarray Minimums | Medium | 38.3% | 50.0% | ArrayDynamic ProgrammingStack+1 |
| Subarray Sums Divisible by K | Medium | 56.0% | 50.0% | ArrayHash TablePrefix Sum |
| Rotting Oranges | Medium | 58.1% | 50.0% | ArrayBreadth-First SearchMatrix |
| Pairs of Songs With Total Durations Divisible by 60 | Medium | 53.4% | 50.0% | ArrayHash TableCounting |
| Capacity To Ship Packages Within D Days | Medium | 73.5% | 50.0% | ArrayBinary Search |
| Remove All Adjacent Duplicates in String II | Medium | 60.9% | 50.0% | StringStack |
| Minimum Remove to Make Valid Parentheses | Medium | 71.3% | 50.0% | StringStack |
| Maximum Points You Can Obtain from Cards | Medium | 57.2% | 50.0% | ArraySliding WindowPrefix Sum |
| Kth Missing Positive Number | Easy | 63.2% | 50.0% | ArrayBinary Search |
| Number of Good Leaf Nodes Pairs | Medium | 71.8% | 50.0% | TreeDepth-First SearchBinary Tree |
| Furthest Building You Can Reach | Medium | 50.7% | 50.0% | ArrayGreedyHeap (Priority Queue) |
| Find the Length of the Longest Common Prefix | Medium | 57.0% | 50.0% | ArrayHash TableString+1 |
| Matchsticks to Square | Medium | 41.6% | 50.0% | ArrayDynamic ProgrammingBacktracking+2 |
| Greatest Common Divisor of Strings | Easy | 53.4% | 50.0% | MathString |
| Water and Jug Problem | Medium | 44.8% | 50.0% | MathDepth-First SearchBreadth-First Search |
| Shortest Bridge | Medium | 59.3% | 50.0% | ArrayDepth-First SearchBreadth-First Search+1 |
| Design Add and Search Words Data Structure | Medium | 48.1% | 50.0% | StringDepth-First SearchDesign+1 |
| Brightest Position on Street | Medium | 60.6% | 50.0% | |
| Super Egg Drop | Hard | 29.8% | 50.0% | MathBinary SearchDynamic Programming |
| Add Two Numbers | Medium | 47.9% | 37.5% | Linked ListMathRecursion |
| Median of Two Sorted Arrays | Hard | 45.9% | 37.5% | ArrayBinary SearchDivide and Conquer |
| Integer to Roman | Medium | 70.4% | 37.5% | Hash TableMathString |
| Merge Two Sorted Lists | Easy | 67.9% | 37.5% | Linked ListRecursion |
| Swap Nodes in Pairs | Medium | 68.9% | 37.5% | Linked ListRecursion |
| Next Permutation | Medium | 44.7% | 37.5% | ArrayTwo Pointers |
| Longest Valid Parentheses | Hard | 38.0% | 37.5% | StringDynamic ProgrammingStack |
| Multiply Strings | Medium | 43.5% | 37.5% | MathStringSimulation |
| Pow(x, n) | Medium | 38.2% | 37.5% | MathRecursion |
| Insert Interval | Medium | 44.7% | 37.5% | Array |
| Unique Paths | Medium | 66.5% | 37.5% | MathDynamic ProgrammingCombinatorics |
| Minimum Path Sum | Medium | 67.8% | 37.5% | ArrayDynamic ProgrammingMatrix |
| Subsets | Medium | 82.0% | 37.5% | ArrayBacktrackingBit Manipulation |
| Remove Duplicates from Sorted Array II | Medium | 64.3% | 37.5% | ArrayTwo Pointers |
| Merge Sorted Array | Easy | 54.4% | 37.5% | ArrayTwo PointersSorting |
| Reverse Linked List II | Medium | 51.0% | 37.5% | Linked List |
| Decode Ways | Medium | 37.6% | 37.5% | StringDynamic Programming |
| Unique Binary Search Trees | Medium | 63.3% | 37.5% | MathDynamic ProgrammingTree+2 |
| Path Sum II | Medium | 61.7% | 37.5% | BacktrackingTreeDepth-First Search+1 |
| Best Time to Buy and Sell Stock III | Hard | 53.1% | 37.5% | ArrayDynamic Programming |
| Valid Palindrome | Easy | 52.8% | 37.5% | Two PointersString |
| Parallel Courses III | Hard | 66.8% | 37.5% | ArrayDynamic ProgrammingGraph Theory+1 |
| Sort List | Medium | 63.8% | 37.5% | Linked ListTwo PointersDivide and Conquer+2 |
| Reverse Words in a String | Medium | 55.5% | 37.5% | Two PointersString |
| Intersection of Two Linked Lists | Easy | 63.2% | 37.5% | Hash TableLinked ListTwo Pointers |
| Fraction to Recurring Decimal | Medium | 30.5% | 37.5% | Hash TableMathString |
| Step-By-Step Directions From a Binary Tree Node to Another | Medium | 56.4% | 37.5% | StringTreeDepth-First Search+1 |
| Find All Possible Recipes from Given Supplies | Medium | 56.8% | 37.5% | ArrayHash TableString+2 |
| Largest Number | Medium | 42.6% | 37.5% | ArrayStringGreedy+1 |
| Best Time to Buy and Sell Stock IV | Hard | 49.5% | 37.5% | ArrayDynamic Programming |
| Rotate Array | Medium | 44.4% | 37.5% | ArrayMathTwo Pointers |
| Happy Number | Easy | 59.2% | 37.5% | Hash TableMathTwo Pointers |
| House Robber II | Medium | 44.6% | 37.5% | ArrayDynamic Programming |
| Maximal Square | Medium | 50.0% | 37.5% | ArrayDynamic ProgrammingMatrix |
| Product of Array Except Self | Medium | 68.6% | 37.5% | ArrayPrefix Sum |
| 3Sum Smaller | Medium | 51.3% | 37.5% | |
| Expression Add Operators | Hard | 42.8% | 37.5% | MathStringBacktracking |
| Number of Islands II | Hard | 40.4% | 37.5% | |
| Shortest Distance from All Buildings | Hard | 44.8% | 37.5% | |
| Minimum Obstacle Removal to Reach Corner | Hard | 70.4% | 37.5% | ArrayBreadth-First SearchGraph Theory+3 |
| Longest Substring with At Most K Distinct Characters | Medium | 49.9% | 37.5% | |
| Search a 2D Matrix | Medium | 53.5% | 37.5% | ArrayBinary SearchMatrix |
| Insert Delete GetRandom O(1) - Duplicates allowed | Hard | 36.4% | 37.5% | ArrayHash TableMath+2 |
| Random Pick Index | Medium | 65.0% | 37.5% | Hash TableMathReservoir Sampling+1 |
| Remove K Digits | Medium | 36.4% | 37.5% | StringStackGreedy+1 |
| Longest Repeating Character Replacement | Medium | 59.0% | 37.5% | Hash TableStringSliding Window |
| Non-overlapping Intervals | Medium | 56.7% | 37.5% | ArrayDynamic ProgrammingGreedy+1 |
| String Compression | Medium | 59.5% | 37.5% | Two PointersString |
| Add Two Numbers II | Medium | 62.4% | 37.5% | Linked ListMathStack |
| 132 Pattern | Medium | 34.5% | 37.5% | ArrayBinary SearchStack+2 |
| LFU Cache | Hard | 48.6% | 37.5% | Hash TableLinked ListDesign+1 |
| Validate IP Address | Medium | 28.2% | 37.5% | String |
| Heaters | Medium | 41.4% | 37.5% | ArrayTwo PointersBinary Search+1 |
| Diagonal Traverse | Medium | 67.0% | 37.5% | ArrayMatrixSimulation |
| Next Greater Element II | Medium | 67.9% | 37.5% | ArrayStackMonotonic Stack |
| Split Message Based on Limit | Hard | 42.0% | 37.5% | StringEnumeration |
| Merge Operations to Turn Array Into a Palindrome | Medium | 68.9% | 37.5% | |
| Coin Change II | Medium | 60.5% | 37.5% | ArrayDynamic Programming |
| Contiguous Array | Medium | 50.8% | 37.5% | ArrayHash TablePrefix Sum |
| Count Pairs Of Similar Strings | Easy | 73.5% | 37.5% | ArrayHash TableString+2 |
| Next Greater Element III | Medium | 35.1% | 37.5% | MathTwo PointersString |
| Task Scheduler | Medium | 62.6% | 37.5% | ArrayHash TableGreedy+3 |
| Design Search Autocomplete System | Hard | 49.7% | 37.5% | |
| Find K Closest Elements | Medium | 49.4% | 37.5% | ArrayTwo PointersBinary Search+3 |
| Maximum Width of Binary Tree | Medium | 45.2% | 37.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Number of Longest Increasing Subsequence | Medium | 51.3% | 37.5% | ArrayDynamic ProgrammingBinary Indexed Tree+1 |
| Valid Palindrome II | Easy | 44.0% | 37.5% | Two PointersStringGreedy |
| Stickers to Spell Word | Hard | 50.6% | 37.5% | ArrayHash TableString+5 |
| Best Time to Buy and Sell Stock with Transaction Fee | Medium | 71.7% | 37.5% | ArrayDynamic ProgrammingGreedy |
| Number of Atoms | Hard | 65.1% | 37.5% | Hash TableStringStack+1 |
| Open the Lock | Medium | 61.1% | 37.5% | ArrayHash TableString+1 |
| Is Graph Bipartite? | Medium | 58.9% | 37.5% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Champagne Tower | Medium | 64.0% | 37.5% | Dynamic Programming |
| Minimize Malware Spread | Hard | 42.9% | 37.5% | ArrayHash TableDepth-First Search+3 |
| Flip String to Monotone Increasing | Medium | 61.8% | 37.5% | StringDynamic Programming |
| Minimum Increment to Make Array Unique | Medium | 60.6% | 37.5% | ArrayGreedySorting+1 |
| Vertical Order Traversal of a Binary Tree | Hard | 53.2% | 37.5% | Hash TableTreeDepth-First Search+3 |
| Subarrays with K Different Integers | Hard | 67.5% | 37.5% | ArrayHash TableSliding Window+1 |
| Cousins in Binary Tree | Easy | 59.1% | 37.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Max Consecutive Ones III | Medium | 67.3% | 37.5% | ArrayBinary SearchSliding Window+1 |
| Shortest Path in Binary Matrix | Medium | 51.1% | 37.5% | ArrayBreadth-First SearchMatrix |
| Smallest Common Region | Medium | 68.3% | 37.5% | |
| Longest Common Subsequence | Medium | 58.9% | 37.5% | StringDynamic Programming |
| Reformat Date | Easy | 68.2% | 37.5% | String |
| Number of Visible People in a Queue | Hard | 72.3% | 37.5% | ArrayStackMonotonic Stack |
| Search Suggestions System | Medium | 65.2% | 37.5% | ArrayStringBinary Search+3 |
| Make Array Non-decreasing or Non-increasing | Hard | 65.6% | 37.5% | |
| Minimum Difficulty of a Job Schedule | Hard | 59.7% | 37.5% | ArrayDynamic Programming |
| Dot Product of Two Sparse Vectors | Medium | 89.9% | 37.5% | |
| Path With Minimum Effort | Medium | 62.8% | 37.5% | ArrayBinary SearchDepth-First Search+4 |
| Remove Nth Node From End of List | Medium | 51.0% | 37.5% | Linked ListTwo Pointers |
| Minimum Moves to Spread Stones Over Grid | Medium | 45.3% | 37.5% | ArrayDynamic ProgrammingBacktracking+3 |
| Combinations | Medium | 74.2% | 37.5% | Backtracking |
| Concatenated Words | Hard | 49.7% | 37.5% | ArrayStringDynamic Programming+3 |
| Valid Word Abbreviation | Easy | 37.0% | 37.5% | |
| Tree Diameter | Medium | 61.2% | 37.5% | |
| Gas Station | Medium | 47.5% | 37.5% | ArrayGreedy |
| Find All Duplicates in an Array | Medium | 76.8% | 37.5% | ArrayHash TableSorting |
| My Calendar I | Medium | 58.2% | 37.5% | ArrayBinary SearchDesign+2 |
| Maximum Product of Three Numbers | Easy | 45.7% | 37.5% | ArrayMathSorting |
| Snakes and Ladders | Medium | 48.0% | 37.5% | ArrayBreadth-First SearchMatrix |
| Permutation in String | Medium | 48.4% | 37.5% | Hash TableTwo PointersString+1 |
| Min Cost to Connect All Points | Medium | 70.3% | 37.5% | ArrayUnion-FindGraph Theory+1 |
| 2 Keys Keyboard | Medium | 59.3% | 37.5% | MathDynamic Programming |
| Replace Words | Medium | 68.6% | 37.5% | ArrayHash TableString+1 |
| Copy List with Random Pointer | Medium | 62.4% | 37.5% | Hash TableLinked List |
| Candy | Hard | 47.9% | 37.5% | ArrayGreedy |
| Reorder Routes to Make All Paths Lead to the City Zero | Medium | 65.6% | 37.5% | Depth-First SearchBreadth-First SearchGraph Theory |
| Sentence Similarity III | Medium | 48.5% | 37.5% | ArrayTwo PointersString |
| The Maze II | Medium | 55.0% | 37.5% | |
| Delete and Earn | Medium | 57.1% | 37.5% | ArrayHash TableDynamic Programming |
| Max Stack | Hard | 45.9% | 37.5% | |
| House Robber III | Medium | 55.6% | 37.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Time Based Key-Value Store | Medium | 49.7% | 37.5% | Hash TableStringBinary Search+1 |
| Diameter of Binary Tree | Easy | 65.0% | 37.5% | TreeDepth-First SearchBinary Tree |
| Maximum Width Ramp | Medium | 55.8% | 37.5% | ArrayTwo PointersStack+1 |
| Find the Duplicate Number | Medium | 64.0% | 37.5% | ArrayTwo PointersBinary Search+1 |
| Unique Paths II | Medium | 44.1% | 37.5% | ArrayDynamic ProgrammingMatrix |
| All Nodes Distance K in Binary Tree | Medium | 67.4% | 37.5% | Hash TableTreeDepth-First Search+2 |
| Numbers At Most N Given Digit Set | Hard | 44.5% | 37.5% | ArrayMathString+2 |
| Best Time to Buy and Sell Stock with Cooldown | Medium | 61.7% | 37.5% | ArrayDynamic Programming |
| Make Costs of Paths Equal in a Binary Tree | Medium | 58.2% | 37.5% | ArrayDynamic ProgrammingGreedy+2 |
| Minimum Cost For Tickets | Medium | 67.4% | 37.5% | ArrayDynamic Programming |
| Letter Case Permutation | Medium | 75.7% | 37.5% | StringBacktrackingBit Manipulation |
| Convert Sorted Array to Binary Search Tree | Easy | 75.2% | 37.5% | ArrayDivide and ConquerTree+2 |
| Minimum Number of Arrows to Burst Balloons | Medium | 61.2% | 37.5% | ArrayGreedySorting |
| Two Sum II - Input Array Is Sorted | Medium | 64.6% | 37.5% | ArrayTwo PointersBinary Search |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 37.5% | ArrayBinary SearchDynamic Programming+1 |
| Add Two Integers | Easy | 87.9% | 37.5% | Math |
| Add Bold Tag in String | Medium | 51.4% | 37.5% | |
| Longest Duplicate Substring | Hard | 31.1% | 37.5% | StringBinary SearchSliding Window+3 |
| Binary Tree Longest Consecutive Sequence | Medium | 54.6% | 37.5% | |
| Event Emitter | Medium | 74.9% | 37.5% | |
| Roman to Integer | Easy | 66.2% | 37.5% | Hash TableMathString |
| Deepest Leaves Sum | Medium | 86.5% | 37.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Count Number of Nice Subarrays | Medium | 74.8% | 37.5% | ArrayHash TableMath+2 |
| Largest Rectangle in Histogram | Hard | 49.3% | 37.5% | ArrayStackMonotonic Stack |
| Regions Cut By Slashes | Medium | 77.5% | 37.5% | ArrayHash TableDepth-First Search+3 |
| Design Memory Allocator | Medium | 49.7% | 37.5% | ArrayHash TableDesign+1 |
| Shortest Unsorted Continuous Subarray | Medium | 38.0% | 37.5% | ArrayTwo PointersStack+3 |
| Robot Room Cleaner | Hard | 77.9% | 37.5% | |
| Minimum Operations to Write the Letter Y on a Grid | Medium | 64.3% | 37.5% | ArrayHash TableMatrix+1 |
| Course Schedule IV | Medium | 59.7% | 37.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| 24 Game | Hard | 59.3% | 37.5% | ArrayMathBacktracking |
| Longest Mountain in Array | Medium | 41.8% | 37.5% | ArrayTwo PointersDynamic Programming+1 |
| Valid Sudoku | Medium | 64.1% | 25.0% | ArrayHash TableMatrix |
| First Missing Positive | Hard | 42.4% | 25.0% | ArrayHash Table |
| Spiral Matrix II | Medium | 74.6% | 25.0% | ArrayMatrixSimulation |
| Plus One | Easy | 49.5% | 25.0% | ArrayMath |
| Maximal Rectangle | Hard | 58.1% | 25.0% | ArrayDynamic ProgrammingStack+2 |
| Path Sum | Easy | 54.4% | 25.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Distinct Subsequences | Hard | 51.5% | 25.0% | StringDynamic Programming |
| Word Ladder II | Hard | 27.5% | 25.0% | Hash TableStringBacktracking+1 |
| Sum of Subarray Ranges | Medium | 60.7% | 25.0% | ArrayStackMonotonic Stack |
| Isomorphic Strings | Easy | 48.0% | 25.0% | Hash TableString |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 25.0% | Hash TableStringDesign+1 |
| Shortest Palindrome | Hard | 41.8% | 25.0% | StringRolling HashString Matching+1 |
| The Skyline Problem | Hard | 45.0% | 25.0% | ArrayDivide and ConquerBinary Indexed Tree+5 |
| Invert Binary Tree | Easy | 79.8% | 25.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Search a 2D Matrix II | Medium | 56.8% | 25.0% | ArrayBinary SearchDivide and Conquer+1 |
| Valid Anagram | Easy | 67.8% | 25.0% | Hash TableStringSorting |
| Graph Valid Tree | Medium | 49.8% | 25.0% | |
| Peeking Iterator | Medium | 61.2% | 25.0% | ArrayDesignIterator |
| Binary Tree Vertical Order Traversal | Medium | 57.7% | 25.0% | |
| Largest BST Subtree | Medium | 45.8% | 25.0% | |
| Increasing Triplet Subsequence | Medium | 39.2% | 25.0% | ArrayGreedy |
| Is Subsequence | Easy | 48.8% | 25.0% | Two PointersStringDynamic Programming |
| Minimum Time Difference | Medium | 62.5% | 25.0% | ArrayMathString+1 |
| 01 Matrix | Medium | 53.3% | 25.0% | ArrayDynamic ProgrammingBreadth-First Search+1 |
| Path Sum IV | Medium | 62.8% | 25.0% | |
| Network Delay Time | Medium | 59.7% | 25.0% | Depth-First SearchBreadth-First SearchGraph Theory+2 |
| Most Profit Assigning Work | Medium | 56.1% | 25.0% | ArrayTwo PointersBinary Search+2 |
| Maximum Frequency Stack | Hard | 66.6% | 25.0% | Hash TableStackDesign+1 |
| Most Stones Removed with Same Row or Column | Medium | 62.7% | 25.0% | Hash TableDepth-First SearchUnion-Find+1 |
| Verifying an Alien Dictionary | Easy | 55.9% | 25.0% | ArrayHash TableString |
| Length of Longest Subarray With at Most K Frequency | Medium | 56.4% | 25.0% | ArrayHash TableSliding Window |
| Minimum Insertions to Balance a Parentheses String | Medium | 53.5% | 25.0% | StringStackGreedy |
| Buildings With an Ocean View | Medium | 80.9% | 25.0% | |
| Minimum Swaps to Group All 1's Together II | Medium | 65.6% | 25.0% | ArraySliding Window |
| Nth Highest Salary | Medium | 38.8% | 25.0% | Database |
| Letter Combinations of a Phone Number | Medium | 65.5% | 25.0% | Hash TableStringBacktracking |
| Car Pooling | Medium | 56.2% | 25.0% | ArraySortingHeap (Priority Queue)+2 |
| Sort Characters By Frequency | Medium | 75.1% | 25.0% | Hash TableStringSorting+3 |
| Combination Sum IV | Medium | 55.0% | 25.0% | ArrayDynamic Programming |
| Process Tasks Using Servers | Medium | 41.9% | 25.0% | ArrayHeap (Priority Queue) |
| Maximal Score After Applying K Operations | Medium | 64.0% | 25.0% | ArrayGreedyHeap (Priority Queue) |
| Number of Connected Components in an Undirected Graph | Medium | 64.8% | 25.0% | |
| Find the Celebrity | Medium | 48.9% | 25.0% | |
| Insert into a Sorted Circular Linked List | Medium | 38.5% | 25.0% | |
| Minimum Number of Operations to Move All Balls to Each Box | Medium | 90.1% | 25.0% | ArrayStringPrefix Sum |
| Top K Frequent Words | Medium | 60.0% | 25.0% | ArrayHash TableString+5 |
| Valid Palindrome III | Hard | 49.1% | 25.0% | |
| Arithmetic Slices | Medium | 64.8% | 25.0% | ArrayDynamic ProgrammingSliding Window |
| Find Positive Integer Solution for a Given Equation | Medium | 69.8% | 25.0% | MathTwo PointersBinary Search+1 |
| Lexicographically Smallest Palindrome | Easy | 80.8% | 25.0% | Two PointersStringGreedy |
| Maximum Spending After Buying Items | Hard | 61.3% | 25.0% | ArrayGreedySorting+2 |
| K-th Smallest in Lexicographical Order | Hard | 46.2% | 25.0% | Trie |
| Rearranging Fruits | Hard | 57.5% | 25.0% | ArrayHash TableGreedy+1 |
| Parallel Courses II | Hard | 30.5% | 25.0% | Dynamic ProgrammingBit ManipulationGraph Theory+1 |
| Parallel Courses | Medium | 62.0% | 25.0% | |
| Maximum Performance of a Team | Hard | 47.7% | 25.0% | ArrayGreedySorting+1 |
| Kth Smallest Element in a BST | Medium | 76.5% | 25.0% | TreeDepth-First SearchBinary Search Tree+1 |
| Construct String from Binary Tree | Medium | 70.6% | 25.0% | StringTreeDepth-First Search+1 |
| Wildcard Matching | Hard | 31.3% | 25.0% | StringDynamic ProgrammingGreedy+1 |
| Put Marbles in Bags | Hard | 72.2% | 25.0% | ArrayGreedySorting+1 |
| Remove Duplicates from Sorted List II | Medium | 51.3% | 25.0% | Linked ListTwo Pointers |
| Valid Mountain Array | Easy | 35.0% | 25.0% | Array |
| Human Traffic of Stadium | Hard | 50.8% | 25.0% | Database |
| Sparse Matrix Multiplication | Medium | 69.2% | 25.0% | |
| Minesweeper | Medium | 68.7% | 25.0% | ArrayDepth-First SearchBreadth-First Search+1 |
| Valid Square | Medium | 44.8% | 25.0% | MathGeometry |
| Longest String Chain | Medium | 62.8% | 25.0% | ArrayHash TableTwo Pointers+3 |
| Symmetric Tree | Easy | 60.7% | 25.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Find Maximum Non-decreasing Array Length | Hard | 18.5% | 25.0% | ArrayBinary SearchDynamic Programming+4 |
| Range Frequency Queries | Medium | 42.1% | 25.0% | ArrayHash TableBinary Search+2 |
| Candy Crush | Medium | 77.3% | 25.0% | |
| Shortest Subarray to be Removed to Make Array Sorted | Medium | 51.3% | 25.0% | ArrayTwo PointersBinary Search+2 |
| Count the Number of Good Subarrays | Medium | 65.9% | 25.0% | ArrayHash TableSliding Window |
| Consecutive Numbers Sum | Hard | 42.6% | 25.0% | MathEnumeration |
| Recover Binary Search Tree | Medium | 58.7% | 25.0% | TreeDepth-First SearchBinary Search Tree+1 |
| Maximum Number of Events That Can Be Attended | Medium | 38.9% | 25.0% | ArrayGreedySorting+1 |
| Wiggle Sort | Medium | 68.4% | 25.0% | |
| Implement Queue using Stacks | Easy | 69.3% | 25.0% | StackDesignQueue |
| Integer Break | Medium | 61.8% | 25.0% | MathDynamic Programming |
| Next Greater Element I | Easy | 75.7% | 25.0% | ArrayHash TableStack+1 |
| H-Index | Medium | 41.1% | 25.0% | ArraySortingCounting Sort |
| Encode and Decode Strings | Medium | 51.2% | 25.0% | |
| Verify Preorder Sequence in Binary Search Tree | Medium | 51.7% | 25.0% | |
| Number of Adjacent Elements With the Same Color | Medium | 58.1% | 25.0% | Array |
| Flatten Deeply Nested Array | Medium | 65.5% | 25.0% | |
| Merge In Between Linked Lists | Medium | 82.8% | 25.0% | Linked List |
| Count Binary Substrings | Easy | 70.2% | 25.0% | Two PointersString |
| Maximum Size Subarray Sum Equals k | Medium | 50.8% | 25.0% | |
| Accounts Merge | Medium | 60.9% | 25.0% | ArrayHash TableString+4 |
| Employee Free Time | Hard | 72.8% | 25.0% | |
| Minimum Operations to Make the Array Increasing | Easy | 81.8% | 25.0% | ArrayGreedy |
| Nth Digit | Medium | 37.1% | 25.0% | MathBinary Search |
| Valid Tic-Tac-Toe State | Medium | 34.7% | 25.0% | ArrayMatrix |
| Robot Bounded In Circle | Medium | 56.4% | 25.0% | MathStringSimulation |
| Find All Anagrams in a String | Medium | 53.3% | 25.0% | Hash TableStringSliding Window |
| Word Pattern II | Medium | 48.8% | 25.0% | |