| Bus Routes | Hard | 47.1% | 100.0% | ArrayHash TableBreadth-First Search |
| Number of Islands | Medium | 63.8% | 87.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Kth Smallest Element in a BST | Medium | 76.5% | 87.5% | TreeDepth-First SearchBinary Search Tree+1 |
| Alien Dictionary | Hard | 37.1% | 87.5% | |
| Number of Islands II | Hard | 40.4% | 87.5% | |
| Find the Closest Palindrome | Hard | 31.8% | 87.5% | MathString |
| Construct Quad Tree | Medium | 78.1% | 87.5% | ArrayDivide and ConquerTree+1 |
| Squares of a Sorted Array | Easy | 73.6% | 87.5% | ArrayTwo PointersSorting |
| Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | 57.3% | 87.5% | ArrayQueueSliding Window+3 |
| Text Justification | Hard | 50.4% | 75.0% | ArrayStringSimulation |
| Word Search | Medium | 46.8% | 75.0% | ArrayStringBacktracking+2 |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 75.0% | ArrayDynamic Programming |
| LRU Cache | Medium | 46.8% | 75.0% | Hash TableLinked ListDesign+1 |
| Word Search II | Hard | 38.1% | 75.0% | ArrayStringBacktracking+2 |
| Product of Array Except Self | Medium | 68.6% | 75.0% | ArrayPrefix Sum |
| Design Hit Counter | Medium | 69.6% | 75.0% | |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 75.0% | ArrayHash TableMath+2 |
| Evaluate Division | Medium | 64.0% | 75.0% | ArrayStringDepth-First Search+4 |
| My Calendar I | Medium | 58.2% | 75.0% | ArrayBinary SearchDesign+2 |
| Random Pick with Weight | Medium | 48.9% | 75.0% | ArrayMathBinary Search+2 |
| First Unique Number | Medium | 57.0% | 75.0% | |
| Two Sum | Easy | 57.1% | 62.5% | ArrayHash Table |
| Letter Combinations of a Phone Number | Medium | 65.5% | 62.5% | Hash TableStringBacktracking |
| Merge k Sorted Lists | Hard | 58.8% | 62.5% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Search in Rotated Sorted Array | Medium | 44.1% | 62.5% | ArrayBinary Search |
| Valid Sudoku | Medium | 64.1% | 62.5% | ArrayHash TableMatrix |
| Sudoku Solver | Hard | 65.4% | 62.5% | ArrayHash TableBacktracking+1 |
| Group Anagrams | Medium | 72.2% | 62.5% | ArrayHash TableString+1 |
| Spiral Matrix | Medium | 56.1% | 62.5% | ArrayMatrixSimulation |
| Minimum Window Substring | Hard | 46.9% | 62.5% | Hash TableStringSliding Window |
| Decode Ways | Medium | 37.6% | 62.5% | StringDynamic Programming |
| Maximum Depth of Binary Tree | Easy | 77.9% | 62.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Word Break | Medium | 49.1% | 62.5% | ArrayHash TableString+3 |
| Course Schedule | Medium | 50.8% | 62.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Course Schedule II | Medium | 55.0% | 62.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Basic Calculator | Hard | 46.5% | 62.5% | MathStringStack+1 |
| Valid Anagram | Easy | 67.8% | 62.5% | Hash TableStringSorting |
| Meeting Rooms II | Medium | 52.5% | 62.5% | |
| Serialize and Deserialize Binary Tree | Hard | 60.3% | 62.5% | StringTreeDepth-First Search+3 |
| House Robber III | Medium | 55.6% | 62.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Top K Frequent Elements | Medium | 65.8% | 62.5% | ArrayHash TableDivide and Conquer+5 |
| Shuffle an Array | Medium | 59.5% | 62.5% | ArrayMathDesign+1 |
| All O`one Data Structure | Hard | 44.1% | 62.5% | Hash TableLinked ListDesign+1 |
| The Maze | Medium | 60.3% | 62.5% | |
| Design In-Memory File System | Hard | 48.4% | 62.5% | |
| Exclusive Time of Functions | Medium | 66.1% | 62.5% | ArrayStack |
| Top K Frequent Words | Medium | 60.0% | 62.5% | ArrayHash TableString+5 |
| Cherry Pickup | Hard | 39.1% | 62.5% | ArrayDynamic ProgrammingMatrix |
| Making A Large Island | Hard | 56.3% | 62.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Shortest Bridge | Medium | 59.3% | 62.5% | ArrayDepth-First SearchBreadth-First Search+1 |
| Time Based Key-Value Store | Medium | 49.7% | 62.5% | Hash TableStringBinary Search+1 |
| Leftmost Column with at Least a One | Medium | 55.1% | 62.5% | |
| Merge Strings Alternately | Easy | 82.1% | 62.5% | Two PointersString |
| Minimum Number of Operations to Make Array Continuous | Hard | 52.1% | 62.5% | ArrayHash TableBinary Search+1 |
| Escape the Spreading Fire | Hard | 37.6% | 62.5% | ArrayBinary SearchBreadth-First Search+1 |
| Count Subarrays With Fixed Bounds | Hard | 69.3% | 62.5% | ArrayQueueSliding Window+1 |
| Split Message Based on Limit | Hard | 42.0% | 62.5% | StringEnumeration |
| Divide Nodes Into the Maximum Number of Groups | Hard | 67.0% | 62.5% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 57.2% | 62.5% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+1 |
| Minimum Operations to Write the Letter Y on a Grid | Medium | 64.3% | 62.5% | ArrayHash TableMatrix+1 |
| Block Placement Queries | Hard | 18.4% | 62.5% | ArrayBinary SearchBinary Indexed Tree+1 |
| Find Minimum Time to Reach Last Room I | Medium | 55.5% | 62.5% | ArrayGraph TheoryHeap (Priority Queue)+2 |
| Rotating the Box | Medium | 79.2% | 62.5% | ArrayTwo PointersMatrix |
| String to Integer (atoi) | Medium | 20.6% | 50.0% | String |
| Regular Expression Matching | Hard | 30.4% | 50.0% | StringDynamic ProgrammingRecursion |
| Roman to Integer | Easy | 66.2% | 50.0% | Hash TableMathString |
| Generate Parentheses | Medium | 78.2% | 50.0% | StringDynamic ProgrammingBacktracking |
| Swap Nodes in Pairs | Medium | 68.9% | 50.0% | Linked ListRecursion |
| Next Permutation | Medium | 44.7% | 50.0% | ArrayTwo Pointers |
| Combination Sum | Medium | 76.1% | 50.0% | ArrayBacktracking |
| Rotate Image | Medium | 79.3% | 50.0% | ArrayMathMatrix |
| Subsets | Medium | 82.0% | 50.0% | ArrayBacktrackingBit Manipulation |
| Largest Rectangle in Histogram | Hard | 49.3% | 50.0% | ArrayStackMonotonic Stack |
| Valid Palindrome | Easy | 52.8% | 50.0% | Two PointersString |
| Clone Graph | Medium | 64.7% | 50.0% | Hash TableDepth-First SearchBreadth-First Search+1 |
| Copy List with Random Pointer | Medium | 62.4% | 50.0% | Hash TableLinked List |
| Word Break II | Hard | 55.1% | 50.0% | ArrayHash TableString+4 |
| Min Stack | Medium | 57.7% | 50.0% | StackDesign |
| One Edit Distance | Medium | 34.5% | 50.0% | |
| Excel Sheet Column Number | Easy | 67.2% | 50.0% | MathString |
| Dungeon Game | Hard | 40.8% | 50.0% | ArrayDynamic ProgrammingMatrix |
| Reverse Words in a String II | Medium | 56.6% | 50.0% | |
| House Robber | Medium | 52.9% | 50.0% | ArrayDynamic Programming |
| Binary Tree Right Side View | Medium | 69.5% | 50.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Happy Number | Easy | 59.2% | 50.0% | Hash TableMathTwo Pointers |
| Reverse Linked List | Easy | 80.2% | 50.0% | Linked ListRecursion |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 50.0% | Hash TableStringDesign+1 |
| Group Shifted Strings | Medium | 67.7% | 50.0% | |
| Factor Combinations | Medium | 50.5% | 50.0% | |
| Trips and Users | Hard | 37.7% | 50.0% | Database |
| Palindrome Permutation | Easy | 68.6% | 50.0% | |
| Walls and Gates | Medium | 63.8% | 50.0% | |
| Word Pattern | Easy | 43.8% | 50.0% | Hash TableString |
| Word Pattern II | Medium | 48.8% | 50.0% | |
| Find Median from Data Stream | Hard | 54.2% | 50.0% | Two PointersDesignSorting+2 |
| Coin Change | Medium | 47.9% | 50.0% | ArrayDynamic ProgrammingBreadth-First Search |
| Find K Pairs with Smallest Sums | Medium | 41.5% | 50.0% | ArrayHeap (Priority Queue) |
| Delete Node in a BST | Medium | 54.2% | 50.0% | TreeBinary Search TreeBinary Tree |
| Optimal Account Balancing | Hard | 50.3% | 50.0% | |
| Longest Palindromic Subsequence | Medium | 65.1% | 50.0% | StringDynamic Programming |
| Encode and Decode TinyURL | Medium | 86.6% | 50.0% | Hash TableStringDesign+1 |
| Replace Words | Medium | 68.6% | 50.0% | ArrayHash TableString+1 |
| Employee Importance | Medium | 69.3% | 50.0% | ArrayHash TableTree+2 |
| Falling Squares | Hard | 47.3% | 50.0% | ArraySegment TreeOrdered Set |
| Flood Fill | Easy | 67.8% | 50.0% | ArrayDepth-First SearchBreadth-First Search+1 |
| Asteroid Collision | Medium | 47.1% | 50.0% | ArrayStackSimulation |
| Open the Lock | Medium | 61.1% | 50.0% | ArrayHash TableString+1 |
| Random Pick with Blacklist | Hard | 34.6% | 50.0% | ArrayHash TableMath+3 |
| Koko Eating Bananas | Medium | 49.7% | 50.0% | ArrayBinary Search |
| Regions Cut By Slashes | Medium | 77.5% | 50.0% | ArrayHash TableDepth-First Search+3 |
| Rotting Oranges | Medium | 58.1% | 50.0% | ArrayBreadth-First SearchMatrix |
| Fixed Point | Easy | 63.8% | 50.0% | |
| Parallel Courses | Medium | 62.0% | 50.0% | |
| Minimum Score Triangulation of Polygon | Medium | 67.4% | 50.0% | ArrayDynamic Programming |
| Remove Zero Sum Consecutive Nodes from Linked List | Medium | 53.1% | 50.0% | Hash TableLinked List |
| Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | 72.1% | 50.0% | Dynamic ProgrammingGraph TheoryShortest Path |
| Find the Distance Value Between Two Arrays | Easy | 71.4% | 50.0% | ArrayTwo PointersBinary Search+1 |
| Construct K Palindrome Strings | Medium | 68.6% | 50.0% | Hash TableStringGreedy+1 |
| Course Schedule IV | Medium | 59.7% | 50.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Number of Nodes in the Sub-Tree With the Same Label | Medium | 55.3% | 50.0% | Hash TableTreeDepth-First Search+2 |
| Remove Max Number of Edges to Keep Graph Fully Traversable | Hard | 70.2% | 50.0% | Union-FindGraph Theory |
| Hopper Company Queries I | Hard | 48.1% | 50.0% | |
| Hopper Company Queries II | Hard | 39.7% | 50.0% | |
| Hopper Company Queries III | Hard | 65.3% | 50.0% | |
| Number Of Ways To Reconstruct A Tree | Hard | 45.3% | 50.0% | ArrayHash TableTree+2 |
| Maximum Number of Eaten Apples | Medium | 42.7% | 50.0% | ArrayGreedyHeap (Priority Queue) |
| Maximum XOR for Each Query | Medium | 84.8% | 50.0% | ArrayBit ManipulationPrefix Sum |
| Minimum Absolute Sum Difference | Medium | 32.2% | 50.0% | ArrayBinary SearchSorting+1 |
| Maximum Subarray Min-Product | Medium | 40.0% | 50.0% | ArrayStackMonotonic Stack+1 |
| Nearest Exit from Entrance in Maze | Medium | 48.3% | 50.0% | ArrayBreadth-First SearchMatrix |
| Check for Contradictions in Equations | Hard | 43.8% | 50.0% | |
| Array With Elements Not Equal to Average of Neighbors | Medium | 50.6% | 50.0% | ArrayGreedySorting |
| Check If String Is a Prefix of Array | Easy | 52.7% | 50.0% | ArrayTwo PointersString |
| Number of Strings That Appear as Substrings in Word | Easy | 82.4% | 50.0% | ArrayString |
| Minimum Time to Complete Trips | Medium | 39.6% | 50.0% | ArrayBinary Search |
| Create Binary Tree From Descriptions | Medium | 81.7% | 50.0% | ArrayHash TableTree+1 |
| Intersection of Multiple Arrays | Easy | 68.6% | 50.0% | ArrayHash TableSorting+1 |
| K Divisible Elements Subarrays | Medium | 54.8% | 50.0% | ArrayHash TableTrie+3 |
| Calculate Digit Sum of a String | Easy | 67.6% | 50.0% | StringSimulation |
| Minimum Sum of Squared Difference | Medium | 26.7% | 50.0% | ArrayBinary SearchGreedy+2 |
| Number of People That Can Be Seen in a Grid | Medium | 47.4% | 50.0% | |
| Meeting Rooms III | Hard | 51.7% | 50.0% | ArrayHash TableSorting+2 |
| Add Edges to Make Degrees of All Nodes Even | Hard | 35.2% | 50.0% | Hash TableGraph Theory |
| Maximize Win From Two Segments | Medium | 37.4% | 50.0% | ArrayBinary SearchSliding Window |
| Check if a String Is an Acronym of Words | Easy | 82.9% | 50.0% | ArrayString |
| Points That Intersect With Cars | Easy | 73.4% | 50.0% | ArrayHash TablePrefix Sum |
| Number of Ways to Reach Destination in the Grid | Hard | 58.4% | 50.0% | |
| Find Pattern in Infinite Stream I | Medium | 56.6% | 50.0% | |
| Find Pattern in Infinite Stream II | Hard | 67.5% | 50.0% | |
| Maximum Increasing Triplet Value | Medium | 35.7% | 50.0% | |
| Match Alphanumerical Pattern in Matrix I | Medium | 64.3% | 50.0% | |
| Minimum Operations to Make Binary Array Elements Equal to One I | Medium | 80.4% | 50.0% | ArrayBit ManipulationQueue+2 |
| Minimum Operations to Make Binary Array Elements Equal to One II | Medium | 65.0% | 50.0% | ArrayDynamic ProgrammingGreedy |
| Find the Number of Ways to Place People II | Hard | 64.4% | 50.0% | ArrayMathGeometry+2 |
| Find Minimum Time to Reach Last Room II | Medium | 67.9% | 50.0% | ArrayGraph TheoryHeap (Priority Queue)+2 |
| Boundary of Binary Tree | Medium | 47.9% | 50.0% | |
| Maximize Amount After Two Days of Conversions | Medium | 61.1% | 50.0% | ArrayStringDepth-First Search+2 |
| Number of Black Blocks | Medium | 41.5% | 50.0% | ArrayHash TableEnumeration |
| Maximum Coin Collection | Medium | 52.8% | 50.0% | |
| The Maze II | Medium | 55.0% | 50.0% | |
| Best Time to Buy and Sell Stock using Strategy | Medium | 59.9% | 50.0% | ArraySliding WindowPrefix Sum |
| Final Prices With a Special Discount in a Shop | Easy | 84.0% | 50.0% | ArrayStackMonotonic Stack |
| Count Paths That Can Form a Palindrome in a Tree | Hard | 48.3% | 50.0% | Dynamic ProgrammingBit ManipulationTree+2 |
| Add Two Numbers | Medium | 47.9% | 37.5% | Linked ListMathRecursion |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 37.5% | Hash TableStringSliding Window |
| Reverse Integer | Medium | 31.5% | 37.5% | Math |
| Container With Most Water | Medium | 59.5% | 37.5% | ArrayTwo PointersGreedy |
| Longest Common Prefix | Easy | 47.1% | 37.5% | ArrayStringTrie |
| Valid Parentheses | Easy | 43.7% | 37.5% | StringStack |
| Find First and Last Position of Element in Sorted Array | Medium | 48.3% | 37.5% | ArrayBinary Search |
| Trapping Rain Water | Hard | 66.8% | 37.5% | ArrayTwo PointersDynamic Programming+2 |
| Permutations | Medium | 81.6% | 37.5% | ArrayBacktracking |
| Maximum Subarray | Medium | 53.0% | 37.5% | ArrayDivide and ConquerDynamic Programming |
| Merge Intervals | Medium | 51.1% | 37.5% | ArraySorting |
| Insert Interval | Medium | 44.7% | 37.5% | Array |
| Minimum Path Sum | Medium | 67.8% | 37.5% | ArrayDynamic ProgrammingMatrix |
| Sqrt(x) | Easy | 41.4% | 37.5% | MathBinary Search |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 37.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Word Ladder | Hard | 44.9% | 37.5% | Hash TableStringBreadth-First Search |
| Longest Consecutive Sequence | Medium | 47.0% | 37.5% | ArrayHash TableUnion-Find |
| Candy | Hard | 47.9% | 37.5% | ArrayGreedy |
| Find Minimum in Rotated Sorted Array | Medium | 53.8% | 37.5% | ArrayBinary Search |
| Find Peak Element | Medium | 46.8% | 37.5% | ArrayBinary Search |
| Shortest Palindrome | Hard | 41.8% | 37.5% | StringRolling HashString Matching+1 |
| Kth Largest Element in an Array | Medium | 68.8% | 37.5% | ArrayDivide and ConquerSorting+2 |
| The Skyline Problem | Hard | 45.0% | 37.5% | ArrayDivide and ConquerBinary Indexed Tree+5 |
| Sliding Window Maximum | Hard | 48.4% | 37.5% | ArrayQueueSliding Window+2 |
| Move Zeroes | Easy | 63.5% | 37.5% | ArrayTwo Pointers |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 37.5% | ArrayDynamic ProgrammingDepth-First Search+5 |
| Patching Array | Hard | 54.1% | 37.5% | ArrayGreedy |
| Reconstruct Itinerary | Hard | 44.3% | 37.5% | ArrayStringDepth-First Search+4 |
| Split Array Largest Sum | Hard | 59.8% | 37.5% | ArrayBinary SearchDynamic Programming+2 |
| Pacific Atlantic Water Flow | Medium | 60.6% | 37.5% | ArrayDepth-First SearchBreadth-First Search+1 |
| Longest Repeating Character Replacement | Medium | 59.0% | 37.5% | Hash TableStringSliding Window |
| LFU Cache | Hard | 48.6% | 37.5% | Hash TableLinked ListDesign+1 |
| Next Greater Element I | Easy | 75.7% | 37.5% | ArrayHash TableStack+1 |
| Task Scheduler | Medium | 62.6% | 37.5% | ArrayHash TableGreedy+3 |
| Candy Crush | Medium | 77.3% | 37.5% | |
| Sliding Puzzle | Hard | 74.1% | 37.5% | ArrayDynamic ProgrammingBacktracking+3 |
| Is Graph Bipartite? | Medium | 58.9% | 37.5% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Cheapest Flights Within K Stops | Medium | 41.4% | 37.5% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+3 |
| Number of Matching Subsequences | Medium | 50.6% | 37.5% | ArrayHash TableString+4 |
| Exam Room | Medium | 43.2% | 37.5% | DesignHeap (Priority Queue)Ordered Set |
| Verifying an Alien Dictionary | Easy | 55.9% | 37.5% | ArrayHash TableString |
| Minimum Cost For Tickets | Medium | 67.4% | 37.5% | ArrayDynamic Programming |
| Interval List Intersections | Medium | 72.9% | 37.5% | ArrayTwo PointersSweep Line |
| Subarrays with K Different Integers | Hard | 67.5% | 37.5% | ArrayHash TableSliding Window+1 |
| Min Cost to Connect All Points | Medium | 70.3% | 37.5% | ArrayUnion-FindGraph Theory+1 |
| Design Parking System | Easy | 87.1% | 37.5% | DesignSimulationCounting |
| Count Nice Pairs in an Array | Medium | 48.4% | 37.5% | ArrayHash TableMath+1 |
| Maximum Earnings From Taxi | Medium | 46.2% | 37.5% | ArrayHash TableBinary Search+2 |
| Time Needed to Buy Tickets | Easy | 72.1% | 37.5% | ArrayQueueSimulation |
| Find All Possible Recipes from Given Supplies | Medium | 56.8% | 37.5% | ArrayHash TableString+2 |
| Number of Flowers in Full Bloom | Hard | 57.7% | 37.5% | ArrayHash TableBinary Search+3 |
| Count the Number of Good Subarrays | Medium | 65.9% | 37.5% | ArrayHash TableSliding Window |
| Collect Coins in a Tree | Hard | 39.6% | 37.5% | ArrayTreeGraph Theory+1 |
| Length of Longest Subarray With at Most K Frequency | Medium | 56.4% | 37.5% | ArrayHash TableSliding Window |
| Find the Length of the Longest Common Prefix | Medium | 57.0% | 37.5% | ArrayHash TableString+1 |
| Minimum Absolute Difference Between Elements With Constraint | Medium | 37.1% | 37.5% | ArrayBinary SearchOrdered Set |
| Smallest String With Swaps | Medium | 60.3% | 37.5% | ArrayHash TableString+4 |
| Design Browser History | Medium | 78.2% | 37.5% | ArrayLinked ListStack+3 |
| Word Ladder II | Hard | 27.5% | 37.5% | Hash TableStringBacktracking+1 |
| Subarray Sums Divisible by K | Medium | 56.0% | 37.5% | ArrayHash TablePrefix Sum |
| Add Digits | Easy | 68.6% | 37.5% | MathSimulationNumber Theory |
| Design File System | Medium | 65.1% | 37.5% | |
| Design Memory Allocator | Medium | 49.6% | 37.5% | ArrayHash TableDesign+1 |
| Longest Path With Different Adjacent Characters | Hard | 53.9% | 37.5% | ArrayStringTree+3 |
| Water and Jug Problem | Medium | 44.8% | 37.5% | MathDepth-First SearchBreadth-First Search |
| Most Profitable Path in a Tree | Medium | 67.3% | 37.5% | ArrayTreeDepth-First Search+2 |
| Brightest Position on Street | Medium | 60.6% | 37.5% | |
| Rotated Digits | Medium | 56.8% | 37.5% | MathDynamic Programming |
| Number of Adjacent Elements With the Same Color | Medium | 58.1% | 37.5% | Array |
| Number of Provinces | Medium | 70.0% | 37.5% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Basic Calculator II | Medium | 46.6% | 37.5% | MathStringStack |
| Detonate the Maximum Bombs | Medium | 49.9% | 37.5% | ArrayMathDepth-First Search+3 |
| Maximum Points You Can Obtain from Cards | Medium | 57.2% | 37.5% | ArraySliding WindowPrefix Sum |
| Burst Balloons | Hard | 62.9% | 37.5% | ArrayDynamic Programming |
| Minimum Cost to Make at Least One Valid Path in a Grid | Hard | 70.9% | 37.5% | ArrayBreadth-First SearchGraph Theory+3 |
| Replace Non-Coprime Numbers in Array | Hard | 57.7% | 37.5% | ArrayMathStack+1 |
| Minimum Operations to Reduce an Integer to 0 | Medium | 61.0% | 37.5% | Dynamic ProgrammingGreedyBit Manipulation |
| The Earliest Moment When Everyone Become Friends | Medium | 65.9% | 37.5% | |
| Median of Two Sorted Arrays | Hard | 45.9% | 25.0% | ArrayBinary SearchDivide and Conquer |
| Longest Palindromic Substring | Medium | 37.3% | 25.0% | Two PointersStringDynamic Programming |
| Palindrome Number | Easy | 60.2% | 25.0% | Math |
| 3Sum | Medium | 38.6% | 25.0% | ArrayTwo PointersSorting |
| Remove Duplicates from Sorted Array | Easy | 62.2% | 25.0% | ArrayTwo Pointers |
| Remove Element | Easy | 61.3% | 25.0% | ArrayTwo Pointers |
| Longest Valid Parentheses | Hard | 38.0% | 25.0% | StringDynamic ProgrammingStack |
| Climbing Stairs | Easy | 53.9% | 25.0% | MathDynamic ProgrammingMemoization |
| Set Matrix Zeroes | Medium | 62.4% | 25.0% | ArrayHash TableMatrix |
| Remove Duplicates from Sorted Array II | Medium | 64.3% | 25.0% | ArrayTwo Pointers |
| Search in Rotated Sorted Array II | Medium | 39.7% | 25.0% | ArrayBinary Search |
| Validate Binary Search Tree | Medium | 35.3% | 25.0% | TreeDepth-First SearchBinary Search Tree+1 |
| Linked List Cycle | Easy | 53.9% | 25.0% | Hash TableLinked ListTwo Pointers |
| Majority Element | Easy | 66.1% | 25.0% | ArrayHash TableDivide and Conquer+2 |
| Isomorphic Strings | Easy | 48.0% | 25.0% | Hash TableString |
| Contains Duplicate | Easy | 64.1% | 25.0% | ArrayHash TableSorting |
| Search a 2D Matrix II | Medium | 56.8% | 25.0% | ArrayBinary SearchDivide and Conquer+1 |
| Strobogrammatic Number | Easy | 47.5% | 25.0% | |
| H-Index | Medium | 41.1% | 25.0% | ArraySortingCounting Sort |
| Longest Increasing Subsequence | Medium | 59.0% | 25.0% | ArrayBinary SearchDynamic Programming |
| Russian Doll Envelopes | Hard | 37.7% | 25.0% | ArrayBinary SearchDynamic Programming+1 |
| Design Twitter | Medium | 44.2% | 25.0% | Hash TableLinked ListDesign+1 |
| Largest Divisible Subset | Medium | 49.4% | 25.0% | ArrayMathDynamic Programming+1 |
| Ransom Note | Easy | 65.6% | 25.0% | Hash TableStringCounting |
| String Compression | Medium | 59.5% | 25.0% | Two PointersString |
| Can I Win | Medium | 31.0% | 25.0% | MathDynamic ProgrammingBit Manipulation+3 |
| Matchsticks to Square | Medium | 41.6% | 25.0% | ArrayDynamic ProgrammingBacktracking+2 |
| Predict the Winner | Medium | 56.1% | 25.0% | ArrayMathDynamic Programming+2 |
| Next Greater Element II | Medium | 67.9% | 25.0% | ArrayStackMonotonic Stack |
| Freedom Trail | Hard | 59.2% | 25.0% | StringDynamic ProgrammingDepth-First Search+1 |
| Contiguous Array | Medium | 50.8% | 25.0% | ArrayHash TablePrefix Sum |
| 01 Matrix | Medium | 53.3% | 25.0% | ArrayDynamic ProgrammingBreadth-First Search+1 |
| Subarray Sum Equals K | Medium | 46.8% | 25.0% | ArrayHash TablePrefix Sum |
| Find K Closest Elements | Medium | 49.4% | 25.0% | ArrayTwo PointersBinary Search+3 |
| Maximum Width of Binary Tree | Medium | 45.2% | 25.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Valid Parenthesis String | Medium | 39.8% | 25.0% | StringDynamic ProgrammingStack+1 |
| Max Area of Island | Medium | 73.8% | 25.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Swim in Rising Water | Hard | 67.6% | 25.0% | ArrayBinary SearchDepth-First Search+4 |
| Custom Sort String | Medium | 72.3% | 25.0% | Hash TableStringSorting |
| Find Eventual Safe States | Medium | 70.3% | 25.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Possible Bipartition | Medium | 52.3% | 25.0% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Complete Binary Tree Inserter | Medium | 65.0% | 25.0% | TreeBreadth-First SearchDesign+1 |
| Capacity To Ship Packages Within D Days | Medium | 73.5% | 25.0% | ArrayBinary Search |
| Analyze User Website Visit Pattern | Medium | 44.2% | 25.0% | |
| Stone Game II | Medium | 72.9% | 25.0% | ArrayMathDynamic Programming+2 |
| Minimum Number of Taps to Open to Water a Garden | Hard | 51.0% | 25.0% | ArrayDynamic ProgrammingGreedy |
| Create Target Array in the Given Order | Easy | 86.5% | 25.0% | ArraySimulation |
| Replace Employee ID With The Unique Identifier | Easy | 83.5% | 25.0% | Database |
| Kth Missing Positive Number | Easy | 63.2% | 25.0% | ArrayBinary Search |
| Furthest Building You Can Reach | Medium | 50.7% | 25.0% | ArrayGreedyHeap (Priority Queue) |
| Recyclable and Low Fat Products | Easy | 88.8% | 25.0% | Database |
| Frequency of the Most Frequent Element | Medium | 44.6% | 25.0% | ArrayBinary SearchGreedy+3 |
| Maximum Number of Accepted Invitations | Medium | 52.3% | 25.0% | |
| Simple Bank System | Medium | 69.8% | 25.0% | ArrayHash TableDesign+1 |
| Amount of New Area Painted Each Day | Hard | 55.6% | 25.0% | |
| Amount of Time for Binary Tree to Be Infected | Medium | 65.1% | 25.0% | Hash TableTreeDepth-First Search+2 |
| Task Scheduler II | Medium | 54.7% | 25.0% | ArrayHash TableSimulation |
| Put Marbles in Bags | Hard | 72.2% | 25.0% | ArrayGreedySorting+1 |
| Continuous Subarrays | Medium | 57.9% | 25.0% | ArrayQueueSliding Window+3 |
| House Robber II | Medium | 44.6% | 25.0% | ArrayDynamic Programming |
| Paint House | Medium | 64.3% | 25.0% | |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | 68.3% | 25.0% | ArrayHash TableDivide and Conquer+2 |
| Strange Printer | Hard | 60.9% | 25.0% | StringDynamic Programming |
| Find the Most Competitive Subsequence | Medium | 52.7% | 25.0% | ArrayStackGreedy+1 |
| Sum of Left Leaves | Easy | 62.4% | 25.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Get Biggest Three Rhombus Sums in a Grid | Medium | 50.1% | 25.0% | ArrayMathSorting+3 |
| Meeting Rooms | Easy | 59.3% | 25.0% | |
| Design Search Autocomplete System | Hard | 49.7% | 25.0% | |
| Minimum Number of Changes to Make Binary String Beautiful | Medium | 76.4% | 25.0% | String |
| Meeting Scheduler | Medium | 55.2% | 25.0% | |
| Kth Smallest Number in Multiplication Table | Hard | 53.8% | 25.0% | MathBinary Search |
| Maximum Width Ramp | Medium | 55.8% | 25.0% | ArrayTwo PointersStack+1 |
| Sum of Distances in Tree | Hard | 65.5% | 25.0% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Maximum Frequency Stack | Hard | 66.6% | 25.0% | Hash TableStackDesign+1 |
| Check if the Rectangle Corner Is Reachable | Hard | 25.3% | 25.0% | ArrayMathDepth-First Search+3 |
| Find the Celebrity | Medium | 48.9% | 25.0% | |
| Count Different Palindromic Subsequences | Hard | 47.5% | 25.0% | StringDynamic Programming |
| Spiral Matrix III | Medium | 84.5% | 25.0% | ArrayMatrixSimulation |
| Design a Text Editor | Hard | 49.9% | 25.0% | Linked ListStringStack+3 |
| Remove Comments | Medium | 40.0% | 25.0% | ArrayString |
| Minimize Malware Spread | Hard | 42.9% | 25.0% | ArrayHash TableDepth-First Search+3 |
| Minimize Malware Spread II | Hard | 45.4% | 25.0% | ArrayHash TableDepth-First Search+3 |
| Surrounded Regions | Medium | 44.7% | 25.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Count Palindromic Subsequences | Hard | 41.0% | 25.0% | StringDynamic Programming |
| Count Prefix and Suffix Pairs II | Hard | 28.0% | 25.0% | ArrayStringTrie+3 |
| Number of Distinct Substrings in a String | Medium | 64.8% | 25.0% | |
| Binary Search Tree Iterator | Medium | 76.1% | 25.0% | StackTreeDesign+3 |
| Number of Subarrays That Match a Pattern I | Medium | 68.4% | 25.0% | ArrayRolling HashString Matching+1 |
| Cache With Time Limit | Medium | 76.0% | 25.0% | |
| 24 Game | Hard | 59.3% | 25.0% | ArrayMathBacktracking |
| Add Strings | Easy | 52.1% | 25.0% | MathStringSimulation |
| Promise Pool | Medium | 79.5% | 25.0% | |
| Maximum Manhattan Distance After K Changes | Medium | 54.2% | 25.0% | Hash TableMathString+1 |
| Shortest Path in a Grid with Obstacles Elimination | Hard | 46.1% | 25.0% | ArrayBreadth-First SearchMatrix |
| Valid Palindrome II | Easy | 44.0% | 25.0% | Two PointersStringGreedy |
| Maximize Sum Of Array After K Negations | Easy | 53.5% | 25.0% | ArrayGreedySorting |
| Largest 1-Bordered Square | Medium | 52.0% | 25.0% | ArrayDynamic ProgrammingMatrix |
| Number of Subarrays with Bounded Maximum | Medium | 54.7% | 25.0% | ArrayTwo Pointers |
| Graph Connectivity With Threshold | Hard | 49.2% | 25.0% | ArrayMathUnion-Find+1 |
| Design Snake Game | Medium | 40.0% | 25.0% | |
| Minimum Cost to Merge Stones | Hard | 45.6% | 25.0% | ArrayDynamic ProgrammingPrefix Sum |
| Simplify Path | Medium | 50.0% | 25.0% | StringStack |
| Shortest Path in Binary Matrix | Medium | 51.1% | 25.0% | ArrayBreadth-First SearchMatrix |
| Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Hard | 66.3% | 25.0% | Union-FindGraph TheorySorting+2 |
| Strobogrammatic Number II | Medium | 53.5% | 25.0% | |
| Cherry Pickup II | Hard | 72.3% | 25.0% | ArrayDynamic ProgrammingMatrix |
| Robot Room Cleaner | Hard | 77.9% | 25.0% | |
| Random Point in Non-overlapping Rectangles | Medium | 39.4% | 25.0% | ArrayMathBinary Search+4 |
| Reverse Nodes in k-Group | Hard | 65.3% | 25.0% | Linked ListRecursion |
| Find the Maximum Length of Valid Subsequence II | Medium | 57.2% | 25.0% | ArrayDynamic Programming |
| Integer Replacement | Medium | 37.1% | 25.0% | Dynamic ProgrammingGreedyBit Manipulation+1 |
| 2 Keys Keyboard | Medium | 59.3% | 25.0% | MathDynamic Programming |
| Binary Tree Longest Consecutive Sequence II | Medium | 50.0% | 25.0% | |
| Maximum Average Subarray I | Easy | 47.0% | 25.0% | ArraySliding Window |
| Ones and Zeroes | Medium | 53.0% | 25.0% | ArrayStringDynamic Programming |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 25.0% | ArrayBinary SearchDynamic Programming+1 |
| Count Integers in Intervals | Hard | 35.6% | 25.0% | DesignSegment TreeOrdered Set |
| Human Traffic of Stadium | Hard | 50.8% | 25.0% | Database |
| Repeated String Match | Medium | 38.3% | 25.0% | StringString Matching |
| Maximum Number of Events That Can Be Attended | Medium | 38.9% | 25.0% | ArrayGreedySorting+1 |
| My Calendar II | Medium | 62.9% | 25.0% | ArrayBinary SearchDesign+3 |
| Insert Delete GetRandom O(1) - Duplicates allowed | Hard | 36.4% | 25.0% | ArrayHash TableMath+2 |
| Find the Safest Path in a Grid | Medium | 48.6% | 25.0% | ArrayBinary SearchBreadth-First Search+3 |
| Closest Binary Search Tree Value | Easy | 49.3% | 25.0% | |
| Accounts Merge | Medium | 60.9% | 25.0% | ArrayHash TableString+4 |
| Minimum Difference in Sums After Removal of Elements | Hard | 69.9% | 25.0% | ArrayDynamic ProgrammingHeap (Priority Queue) |
| Count Primes | Medium | 35.7% | 25.0% | ArrayMathEnumeration+1 |
| Linked List Components | Medium | 57.7% | 25.0% | ArrayHash TableLinked List |
| Count Binary Substrings | Easy | 70.2% | 25.0% | Two PointersString |
| Bomb Enemy | Medium | 52.8% | 25.0% | |
| Find All People With Secret | Hard | 48.4% | 25.0% | Depth-First SearchBreadth-First SearchUnion-Find+2 |
| Car Pooling | Medium | 56.2% | 25.0% | ArraySortingHeap (Priority Queue)+2 |
| Magnetic Force Between Two Balls | Medium | 71.9% | 25.0% | ArrayBinary SearchSorting |
| Rearranging Fruits | Hard | 57.5% | 25.0% | ArrayHash TableGreedy+1 |
| IPO | Hard | 53.3% | 25.0% | ArrayGreedySorting+1 |
| Maximum Number of Points From Grid Queries | Hard | 59.3% | 25.0% | ArrayTwo PointersBreadth-First Search+4 |
| Design A Leaderboard | Medium | 68.1% | 25.0% | |
| Minimum Jumps to Reach End via Prime Teleportation | Medium | 31.8% | 25.0% | ArrayHash TableMath+2 |
| Process Restricted Friend Requests | Hard | 59.4% | 25.0% | Union-FindGraph Theory |
| Shortest Path to Get All Keys | Hard | 54.3% | 25.0% | ArrayBit ManipulationBreadth-First Search+1 |