| Kth Largest Element in an Array | Medium | 68.8% | 100.0% | ArrayDivide and ConquerSorting+2 |
| Binary Tree Vertical Order Traversal | Medium | 57.7% | 100.0% | |
| Valid Word Abbreviation | Easy | 37.0% | 100.0% | |
| Valid Palindrome II | Easy | 44.0% | 100.0% | Two PointersStringGreedy |
| Minimum Remove to Make Valid Parentheses | Medium | 71.3% | 100.0% | StringStack |
| Two Sum | Easy | 57.1% | 87.5% | ArrayHash Table |
| Pow(x, n) | Medium | 38.2% | 87.5% | MathRecursion |
| Merge Intervals | Medium | 51.1% | 87.5% | ArraySorting |
| Simplify Path | Medium | 50.0% | 87.5% | StringStack |
| Merge Sorted Array | Easy | 54.4% | 87.5% | ArrayTwo PointersSorting |
| Valid Palindrome | Easy | 52.8% | 87.5% | Two PointersString |
| Find Peak Element | Medium | 46.8% | 87.5% | ArrayBinary Search |
| Binary Tree Right Side View | Medium | 69.5% | 87.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Basic Calculator II | Medium | 46.6% | 87.5% | MathStringStack |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.7% | 87.5% | TreeDepth-First SearchBinary Tree |
| Nested List Weight Sum | Medium | 85.9% | 87.5% | |
| Top K Frequent Elements | Medium | 65.8% | 87.5% | ArrayHash TableDivide and Conquer+5 |
| Diameter of Binary Tree | Easy | 65.0% | 87.5% | TreeDepth-First SearchBinary Tree |
| Subarray Sum Equals K | Medium | 46.8% | 87.5% | ArrayHash TablePrefix Sum |
| Random Pick with Weight | Medium | 48.9% | 87.5% | ArrayMathBinary Search+2 |
| Shortest Path in Binary Matrix | Medium | 51.1% | 87.5% | ArrayBreadth-First SearchMatrix |
| Dot Product of Two Sparse Vectors | Medium | 89.9% | 87.5% | |
| Lowest Common Ancestor of a Binary Tree III | Medium | 82.9% | 87.5% | |
| Buildings With an Ocean View | Medium | 80.9% | 87.5% | |
| Add Two Numbers | Medium | 47.9% | 75.0% | Linked ListMathRecursion |
| Longest Common Prefix | Easy | 47.1% | 75.0% | ArrayStringTrie |
| 3Sum | Medium | 38.6% | 75.0% | ArrayTwo PointersSorting |
| Valid Parentheses | Easy | 43.7% | 75.0% | StringStack |
| Merge k Sorted Lists | Hard | 58.8% | 75.0% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Next Permutation | Medium | 44.7% | 75.0% | ArrayTwo Pointers |
| Find First and Last Position of Element in Sorted Array | Medium | 48.3% | 75.0% | ArrayBinary Search |
| Minimum Window Substring | Hard | 46.9% | 75.0% | Hash TableStringSliding Window |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 75.0% | ArrayDynamic Programming |
| Sum Root to Leaf Numbers | Medium | 69.6% | 75.0% | TreeDepth-First SearchBinary Tree |
| Clone Graph | Medium | 64.7% | 75.0% | Hash TableDepth-First SearchBreadth-First Search+1 |
| Copy List with Random Pointer | Medium | 62.4% | 75.0% | Hash TableLinked List |
| LRU Cache | Medium | 46.8% | 75.0% | Hash TableLinked ListDesign+1 |
| Moving Average from Data Stream | Easy | 80.2% | 75.0% | |
| Maximum Swap | Medium | 51.9% | 75.0% | MathGreedy |
| Custom Sort String | Medium | 72.3% | 75.0% | Hash TableStringSorting |
| Making A Large Island | Hard | 56.3% | 75.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Minimum Add to Make Parentheses Valid | Medium | 74.4% | 75.0% | StringStackGreedy |
| Range Sum of BST | Easy | 87.6% | 75.0% | TreeDepth-First SearchBinary Search Tree+1 |
| K Closest Points to Origin | Medium | 68.7% | 75.0% | ArrayMathDivide and Conquer+4 |
| Interval List Intersections | Medium | 72.9% | 75.0% | ArrayTwo PointersSweep Line |
| Vertical Order Traversal of a Binary Tree | Hard | 53.2% | 75.0% | Hash TableTreeDepth-First Search+3 |
| Max Consecutive Ones III | Medium | 67.3% | 75.0% | ArrayBinary SearchSliding Window+1 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 62.5% | Hash TableStringSliding Window |
| Median of Two Sorted Arrays | Hard | 45.9% | 62.5% | ArrayBinary SearchDivide and Conquer |
| Longest Palindromic Substring | Medium | 37.3% | 62.5% | Two PointersStringDynamic Programming |
| String to Integer (atoi) | Medium | 20.6% | 62.5% | String |
| Palindrome Number | Easy | 60.2% | 62.5% | Math |
| Container With Most Water | Medium | 59.5% | 62.5% | ArrayTwo PointersGreedy |
| Roman to Integer | Easy | 66.2% | 62.5% | Hash TableMathString |
| Letter Combinations of a Phone Number | Medium | 65.5% | 62.5% | Hash TableStringBacktracking |
| Remove Nth Node From End of List | Medium | 51.0% | 62.5% | Linked ListTwo Pointers |
| Remove Duplicates from Sorted Array | Easy | 62.2% | 62.5% | ArrayTwo Pointers |
| Search in Rotated Sorted Array | Medium | 44.1% | 62.5% | ArrayBinary Search |
| Trapping Rain Water | Hard | 66.8% | 62.5% | ArrayTwo PointersDynamic Programming+2 |
| Maximum Subarray | Medium | 53.0% | 62.5% | ArrayDivide and ConquerDynamic Programming |
| Valid Number | Hard | 22.6% | 62.5% | String |
| Climbing Stairs | Easy | 53.9% | 62.5% | MathDynamic ProgrammingMemoization |
| Subsets | Medium | 82.0% | 62.5% | ArrayBacktrackingBit Manipulation |
| Majority Element | Easy | 66.1% | 62.5% | ArrayHash TableDivide and Conquer+2 |
| Binary Search Tree Iterator | Medium | 76.1% | 62.5% | StackTreeDesign+3 |
| Number of Islands | Medium | 63.8% | 62.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Course Schedule | Medium | 50.8% | 62.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Contains Duplicate II | Easy | 50.8% | 62.5% | ArrayHash TableSliding Window |
| Group Shifted Strings | Medium | 67.7% | 62.5% | |
| Closest Binary Search Tree Value | Easy | 49.3% | 62.5% | |
| Expression Add Operators | Hard | 42.8% | 62.5% | MathStringBacktracking |
| Move Zeroes | Easy | 63.5% | 62.5% | ArrayTwo Pointers |
| Random Pick Index | Medium | 65.0% | 62.5% | Hash TableMathReservoir Sampling+1 |
| Add Strings | Easy | 52.1% | 62.5% | MathStringSimulation |
| Sliding Window Median | Hard | 38.9% | 62.5% | ArrayHash TableSliding Window+1 |
| Diagonal Traverse | Medium | 67.0% | 62.5% | ArrayMatrixSimulation |
| Continuous Subarray Sum | Medium | 31.2% | 62.5% | ArrayHash TableMath+1 |
| Exclusive Time of Functions | Medium | 66.1% | 62.5% | ArrayStack |
| Palindromic Substrings | Medium | 72.5% | 62.5% | Two PointersStringDynamic Programming |
| Accounts Merge | Medium | 60.9% | 62.5% | ArrayHash TableString+4 |
| Convert Binary Search Tree to Sorted Doubly Linked List | Medium | 65.6% | 62.5% | |
| Toeplitz Matrix | Easy | 69.6% | 62.5% | ArrayMatrix |
| Insert into a Sorted Circular Linked List | Medium | 38.5% | 62.5% | |
| Goat Latin | Easy | 69.9% | 62.5% | String |
| Robot Room Cleaner | Hard | 77.9% | 62.5% | |
| All Nodes Distance K in Binary Tree | Medium | 67.4% | 62.5% | Hash TableTreeDepth-First Search+2 |
| Remove All Adjacent Duplicates In String | Easy | 72.8% | 62.5% | StringStack |
| Valid Palindrome III | Hard | 49.1% | 62.5% | |
| Kth Missing Positive Number | Easy | 63.2% | 62.5% | ArrayBinary Search |
| Merge Strings Alternately | Easy | 82.1% | 62.5% | Two PointersString |
| Recyclable and Low Fat Products | Easy | 88.8% | 62.5% | Database |
| Create Hello World Function | Easy | 82.0% | 62.5% | |
| Reverse Integer | Medium | 31.5% | 50.0% | Math |
| Regular Expression Matching | Hard | 30.4% | 50.0% | StringDynamic ProgrammingRecursion |
| 3Sum Closest | Medium | 48.0% | 50.0% | ArrayTwo PointersSorting |
| 4Sum | Medium | 40.0% | 50.0% | ArrayTwo PointersSorting |
| Merge Two Sorted Lists | Easy | 67.9% | 50.0% | Linked ListRecursion |
| Generate Parentheses | Medium | 78.2% | 50.0% | StringDynamic ProgrammingBacktracking |
| Find the Index of the First Occurrence in a String | Easy | 46.2% | 50.0% | Two PointersStringString Matching |
| Longest Valid Parentheses | Hard | 38.0% | 50.0% | StringDynamic ProgrammingStack |
| Count and Say | Medium | 62.3% | 50.0% | String |
| Multiply Strings | Medium | 43.5% | 50.0% | MathStringSimulation |
| Rotate Image | Medium | 79.3% | 50.0% | ArrayMathMatrix |
| Group Anagrams | Medium | 72.2% | 50.0% | ArrayHash TableString+1 |
| Spiral Matrix | Medium | 56.1% | 50.0% | ArrayMatrixSimulation |
| Jump Game | Medium | 40.5% | 50.0% | ArrayDynamic ProgrammingGreedy |
| Insert Interval | Medium | 44.7% | 50.0% | Array |
| Unique Paths | Medium | 66.5% | 50.0% | MathDynamic ProgrammingCombinatorics |
| Plus One | Easy | 49.5% | 50.0% | ArrayMath |
| Add Binary | Easy | 57.6% | 50.0% | MathStringBit Manipulation+1 |
| Sqrt(x) | Easy | 41.4% | 50.0% | MathBinary Search |
| Set Matrix Zeroes | Medium | 62.4% | 50.0% | ArrayHash TableMatrix |
| Sort Colors | Medium | 69.1% | 50.0% | ArrayTwo PointersSorting |
| Word Search | Medium | 46.8% | 50.0% | ArrayStringBacktracking+2 |
| Largest Rectangle in Histogram | Hard | 49.3% | 50.0% | ArrayStackMonotonic Stack |
| Binary Tree Level Order Traversal | Medium | 72.2% | 50.0% | TreeBreadth-First SearchBinary Tree |
| Populating Next Right Pointers in Each Node | Medium | 66.8% | 50.0% | Linked ListTreeDepth-First Search+2 |
| Pascal's Triangle | Easy | 78.7% | 50.0% | ArrayDynamic Programming |
| Best Time to Buy and Sell Stock II | Medium | 70.7% | 50.0% | ArrayDynamic ProgrammingGreedy |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 50.0% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Word Ladder | Hard | 44.9% | 50.0% | Hash TableStringBreadth-First Search |
| Longest Consecutive Sequence | Medium | 47.0% | 50.0% | ArrayHash TableUnion-Find |
| Palindrome Partitioning | Medium | 73.7% | 50.0% | StringDynamic ProgrammingBacktracking |
| Word Break | Medium | 49.1% | 50.0% | ArrayHash TableString+3 |
| Missing Ranges | Easy | 35.5% | 50.0% | |
| Reverse Linked List | Easy | 80.2% | 50.0% | Linked ListRecursion |
| Course Schedule II | Medium | 55.0% | 50.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Basic Calculator | Hard | 46.5% | 50.0% | MathStringStack+1 |
| Palindrome Linked List | Easy | 57.4% | 50.0% | Linked ListTwo PointersStack+1 |
| Lowest Common Ancestor of a Binary Search Tree | Medium | 70.0% | 50.0% | TreeDepth-First SearchBinary Search Tree+1 |
| Product of Array Except Self | Medium | 68.6% | 50.0% | ArrayPrefix Sum |
| Sliding Window Maximum | Hard | 48.4% | 50.0% | ArrayQueueSliding Window+2 |
| Valid Anagram | Easy | 67.8% | 50.0% | Hash TableStringSorting |
| Strobogrammatic Number | Easy | 47.5% | 50.0% | |
| Meeting Rooms II | Medium | 52.5% | 50.0% | |
| Alien Dictionary | Hard | 37.1% | 50.0% | |
| First Bad Version | Easy | 46.8% | 50.0% | Binary SearchInteractive |
| Find Median from Data Stream | Hard | 54.2% | 50.0% | Two PointersDesignSorting+2 |
| Remove Invalid Parentheses | Hard | 49.8% | 50.0% | StringBacktrackingBreadth-First Search |
| Shortest Distance from All Buildings | Hard | 44.8% | 50.0% | |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 50.0% | ArrayDynamic ProgrammingDepth-First Search+5 |
| Design Tic-Tac-Toe | Medium | 58.7% | 50.0% | |
| Kth Smallest Element in a Sorted Matrix | Medium | 64.4% | 50.0% | ArrayBinary SearchSorting+2 |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 50.0% | ArrayHash TableMath+2 |
| Decode String | Medium | 62.2% | 50.0% | StringStackRecursion |
| Battleships in a Board | Medium | 77.3% | 50.0% | ArrayDepth-First SearchMatrix |
| String Compression | Medium | 59.5% | 50.0% | Two PointersString |
| Target Sum | Medium | 51.8% | 50.0% | ArrayDynamic ProgrammingBacktracking |
| Contiguous Array | Medium | 50.8% | 50.0% | ArrayHash TablePrefix Sum |
| Minesweeper | Medium | 68.7% | 50.0% | ArrayDepth-First SearchBreadth-First Search+1 |
| Construct Binary Tree from String | Medium | 58.7% | 50.0% | |
| Single Element in a Sorted Array | Medium | 59.2% | 50.0% | ArrayBinary Search |
| Boundary of Binary Tree | Medium | 47.9% | 50.0% | |
| Can Place Flowers | Easy | 29.0% | 50.0% | ArrayGreedy |
| Maximum Average Subarray I | Easy | 47.0% | 50.0% | ArraySliding Window |
| Find K Closest Elements | Medium | 49.4% | 50.0% | ArrayTwo PointersBinary Search+3 |
| Max Area of Island | Medium | 73.8% | 50.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Daily Temperatures | Medium | 68.3% | 50.0% | ArrayStackMonotonic Stack |
| Friends Of Appropriate Ages | Medium | 49.8% | 50.0% | ArrayTwo PointersBinary Search+1 |
| Koko Eating Bananas | Medium | 49.7% | 50.0% | ArrayBinary Search |
| Verifying an Alien Dictionary | Easy | 55.9% | 50.0% | ArrayHash TableString |
| Check Completeness of a Binary Tree | Medium | 58.9% | 50.0% | TreeBreadth-First SearchBinary Tree |
| Squares of a Sorted Array | Easy | 73.6% | 50.0% | ArrayTwo PointersSorting |
| Capacity To Ship Packages Within D Days | Medium | 73.5% | 50.0% | ArrayBinary Search |
| Missing Element in Sorted Array | Medium | 59.7% | 50.0% | |
| Remove All Adjacent Duplicates in String II | Medium | 60.9% | 50.0% | StringStack |
| Diagonal Traverse II | Medium | 58.3% | 50.0% | ArraySortingHeap (Priority Queue) |
| Minimum Time to Collect All Apples in a Tree | Medium | 63.5% | 50.0% | Hash TableTreeDepth-First Search+1 |
| Product of Two Run-Length Encoded Arrays | Medium | 59.6% | 50.0% | |
| Count Nodes Equal to Average of Subtree | Medium | 86.7% | 50.0% | TreeDepth-First SearchBinary Tree |
| Add Two Integers | Easy | 87.9% | 50.0% | Math |
| Zigzag Conversion | Medium | 53.5% | 37.5% | String |
| Integer to Roman | Medium | 70.4% | 37.5% | Hash TableMathString |
| Reverse Nodes in k-Group | Hard | 65.3% | 37.5% | Linked ListRecursion |
| Remove Element | Easy | 61.3% | 37.5% | ArrayTwo Pointers |
| Divide Two Integers | Medium | 19.4% | 37.5% | MathBit Manipulation |
| Search Insert Position | Easy | 50.7% | 37.5% | ArrayBinary Search |
| Valid Sudoku | Medium | 64.1% | 37.5% | ArrayHash TableMatrix |
| Sudoku Solver | Hard | 65.4% | 37.5% | ArrayHash TableBacktracking+1 |
| Combination Sum | Medium | 76.1% | 37.5% | ArrayBacktracking |
| Combination Sum II | Medium | 59.0% | 37.5% | ArrayBacktracking |
| First Missing Positive | Hard | 42.4% | 37.5% | ArrayHash Table |
| Wildcard Matching | Hard | 31.3% | 37.5% | StringDynamic ProgrammingGreedy+1 |
| Jump Game II | Medium | 42.4% | 37.5% | ArrayDynamic ProgrammingGreedy |
| Permutations | Medium | 81.6% | 37.5% | ArrayBacktracking |
| N-Queens | Hard | 74.9% | 37.5% | ArrayBacktracking |
| Length of Last Word | Easy | 58.3% | 37.5% | String |
| Rotate List | Medium | 41.2% | 37.5% | Linked ListTwo Pointers |
| Text Justification | Hard | 50.4% | 37.5% | ArrayStringSimulation |
| Search a 2D Matrix | Medium | 53.5% | 37.5% | ArrayBinary SearchMatrix |
| Remove Duplicates from Sorted Array II | Medium | 64.3% | 37.5% | ArrayTwo Pointers |
| Search in Rotated Sorted Array II | Medium | 39.7% | 37.5% | ArrayBinary Search |
| Maximal Rectangle | Hard | 58.1% | 37.5% | ArrayDynamic ProgrammingStack+2 |
| Subsets II | Medium | 60.9% | 37.5% | ArrayBacktrackingBit Manipulation |
| Decode Ways | Medium | 37.6% | 37.5% | StringDynamic Programming |
| Reverse Linked List II | Medium | 51.0% | 37.5% | Linked List |
| Binary Tree Inorder Traversal | Easy | 79.7% | 37.5% | StackTreeDepth-First Search+1 |
| Validate Binary Search Tree | Medium | 35.3% | 37.5% | TreeDepth-First SearchBinary Search Tree+1 |
| Same Tree | Easy | 66.6% | 37.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.1% | 37.5% | TreeBreadth-First SearchBinary Tree |
| Maximum Depth of Binary Tree | Easy | 77.9% | 37.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | 68.3% | 37.5% | ArrayHash TableDivide and Conquer+2 |
| Path Sum II | Medium | 61.7% | 37.5% | BacktrackingTreeDepth-First Search+1 |
| Flatten Binary Tree to Linked List | Medium | 70.2% | 37.5% | Linked ListStackTree+2 |
| Populating Next Right Pointers in Each Node II | Medium | 57.1% | 37.5% | Linked ListTreeDepth-First Search+2 |
| Word Ladder II | Hard | 27.5% | 37.5% | Hash TableStringBacktracking+1 |
| Gas Station | Medium | 47.5% | 37.5% | ArrayGreedy |
| Candy | Hard | 47.9% | 37.5% | ArrayGreedy |
| Single Number | Easy | 77.3% | 37.5% | ArrayBit Manipulation |
| Word Break II | Hard | 55.1% | 37.5% | ArrayHash TableString+4 |
| Reorder List | Medium | 64.6% | 37.5% | Linked ListTwo PointersStack+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 |
| Maximum Product Subarray | Medium | 36.0% | 37.5% | ArrayDynamic Programming |
| Find Minimum in Rotated Sorted Array | Medium | 53.8% | 37.5% | ArrayBinary Search |
| Min Stack | Medium | 57.7% | 37.5% | StackDesign |
| Intersection of Two Linked Lists | Easy | 63.2% | 37.5% | Hash TableLinked ListTwo Pointers |
| Two Sum II - Input Array Is Sorted | Medium | 64.6% | 37.5% | ArrayTwo PointersBinary Search |
| Excel Sheet Column Title | Easy | 45.7% | 37.5% | MathString |
| Second Highest Salary | Medium | 46.3% | 37.5% | Database |
| Largest Number | Medium | 42.6% | 37.5% | ArrayStringGreedy+1 |
| Rotate Array | Medium | 44.4% | 37.5% | ArrayMathTwo Pointers |
| Rising Temperature | Easy | 51.0% | 37.5% | Database |
| House Robber | Medium | 52.9% | 37.5% | ArrayDynamic Programming |
| Happy Number | Easy | 59.2% | 37.5% | Hash TableMathTwo Pointers |
| Count Primes | Medium | 35.7% | 37.5% | ArrayMathEnumeration+1 |
| Isomorphic Strings | Easy | 48.0% | 37.5% | Hash TableString |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 37.5% | Hash TableStringDesign+1 |
| Minimum Size Subarray Sum | Medium | 51.0% | 37.5% | ArrayBinary SearchSliding Window+1 |
| Contains Duplicate | Easy | 64.1% | 37.5% | ArrayHash TableSorting |
| The Skyline Problem | Hard | 45.0% | 37.5% | ArrayDivide and ConquerBinary Indexed Tree+5 |
| Maximal Square | Medium | 50.0% | 37.5% | ArrayDynamic ProgrammingMatrix |
| Kth Smallest Element in a BST | Medium | 76.5% | 37.5% | TreeDepth-First SearchBinary Search Tree+1 |
| Power of Two | Easy | 49.8% | 37.5% | MathBit ManipulationRecursion |
| Delete Node in a Linked List | Medium | 83.6% | 37.5% | Linked List |
| Strobogrammatic Number II | Medium | 53.5% | 37.5% | |
| Meeting Rooms | Easy | 59.3% | 37.5% | |
| Binary Tree Paths | Easy | 68.2% | 37.5% | StringBacktrackingTree+2 |
| Missing Number | Easy | 71.6% | 37.5% | ArrayHash TableMath+3 |
| Integer to English Words | Hard | 34.8% | 37.5% | MathStringRecursion |
| Walls and Gates | Medium | 63.8% | 37.5% | |
| Find the Duplicate Number | Medium | 64.0% | 37.5% | ArrayTwo PointersBinary Search+1 |
| Serialize and Deserialize Binary Tree | Hard | 60.3% | 37.5% | StringTreeDepth-First Search+3 |
| Longest Increasing Subsequence | Medium | 59.0% | 37.5% | ArrayBinary SearchDynamic Programming |
| Range Sum Query - Immutable | Easy | 71.4% | 37.5% | ArrayDesignPrefix Sum |
| Range Sum Query 2D - Immutable | Medium | 57.8% | 37.5% | ArrayDesignMatrix+1 |
| Sparse Matrix Multiplication | Medium | 69.2% | 37.5% | |
| Coin Change | Medium | 47.9% | 37.5% | ArrayDynamic ProgrammingBreadth-First Search |
| Maximum Size Subarray Sum Equals k | Medium | 50.8% | 37.5% | |
| Odd Even Linked List | Medium | 62.3% | 37.5% | Linked List |
| Largest BST Subtree | Medium | 45.8% | 37.5% | |
| Increasing Triplet Subsequence | Medium | 39.2% | 37.5% | ArrayGreedy |
| Flatten Nested List Iterator | Medium | 65.6% | 37.5% | StackTreeDepth-First Search+3 |
| Reverse String | Easy | 80.5% | 37.5% | Two PointersString |
| Intersection of Two Arrays | Easy | 77.5% | 37.5% | ArrayHash TableTwo Pointers+2 |
| Ransom Note | Easy | 65.6% | 37.5% | Hash TableStringCounting |
| Is Subsequence | Easy | 48.8% | 37.5% | Two PointersStringDynamic Programming |
| Remove K Digits | Medium | 36.4% | 37.5% | StringStackGreedy+1 |
| Split Array Largest Sum | Hard | 59.8% | 37.5% | ArrayBinary SearchDynamic Programming+2 |
| Partition Equal Subset Sum | Medium | 49.2% | 37.5% | ArrayDynamic Programming |
| Longest Repeating Character Replacement | Medium | 59.0% | 37.5% | Hash TableStringSliding Window |
| Non-overlapping Intervals | Medium | 56.7% | 37.5% | ArrayDynamic ProgrammingGreedy+1 |
| Max Consecutive Ones | Easy | 64.6% | 37.5% | Array |
| The Maze | Medium | 60.3% | 37.5% | |
| Reverse Pairs | Hard | 33.7% | 37.5% | ArrayBinary SearchDivide and Conquer+4 |
| Next Greater Element I | Easy | 75.7% | 37.5% | ArrayHash TableStack+1 |
| Next Greater Element II | Medium | 67.9% | 37.5% | ArrayStackMonotonic Stack |
| Next Greater Element III | Medium | 35.1% | 37.5% | MathTwo PointersString |
| Permutation in String | Medium | 48.4% | 37.5% | Hash TableTwo PointersString+1 |
| Managers with at Least 5 Direct Reports | Medium | 48.9% | 37.5% | Database |
| Subtree of Another Tree | Easy | 51.2% | 37.5% | TreeDepth-First SearchString Matching+2 |
| Find Customer Referee | Easy | 72.6% | 37.5% | Database |
| Big Countries | Easy | 68.4% | 37.5% | Database |
| Friend Requests II: Who Has the Most Friends | Medium | 62.2% | 37.5% | Database |
| Task Scheduler | Medium | 62.6% | 37.5% | ArrayHash TableGreedy+3 |
| Two Sum IV - Input is a BST | Easy | 63.0% | 37.5% | Hash TableTwo PointersTree+4 |
| Maximum Sum of 3 Non-Overlapping Subarrays | Hard | 59.7% | 37.5% | ArrayDynamic ProgrammingSliding Window+1 |
| Stickers to Spell Word | Hard | 50.6% | 37.5% | ArrayHash TableString+5 |
| Find Pivot Index | Easy | 62.1% | 37.5% | ArrayPrefix Sum |
| Asteroid Collision | Medium | 47.1% | 37.5% | ArrayStackSimulation |
| Kth Largest Element in a Stream | Easy | 60.7% | 37.5% | TreeDesignBinary Search Tree+3 |
| Binary Search | Easy | 60.5% | 37.5% | ArrayBinary Search |
| Swim in Rising Water | Hard | 67.6% | 37.5% | ArrayBinary SearchDepth-First Search+4 |
| Letter Case Permutation | Medium | 75.7% | 37.5% | StringBacktrackingBit Manipulation |
| Is Graph Bipartite? | Medium | 58.9% | 37.5% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Rotate String | Easy | 65.1% | 37.5% | StringString Matching |
| Peak Index in a Mountain Array | Medium | 66.9% | 37.5% | ArrayBinary Search |
| Smallest Subtree with all the Deepest Nodes | Medium | 77.5% | 37.5% | Hash TableTreeDepth-First Search+2 |
| Middle of the Linked List | Easy | 81.5% | 37.5% | Linked ListTwo Pointers |
| Monotonic Array | Easy | 62.2% | 37.5% | Array |
| Sort Array By Parity | Easy | 76.5% | 37.5% | ArrayTwo PointersSorting |
| Shortest Bridge | Medium | 59.3% | 37.5% | ArrayDepth-First SearchBreadth-First Search+1 |
| Binary Tree Cameras | Hard | 47.6% | 37.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Fibonacci Number | Easy | 73.9% | 37.5% | MathDynamic ProgrammingRecursion+1 |
| Minimum Cost For Tickets | Medium | 67.4% | 37.5% | ArrayDynamic Programming |
| Rotting Oranges | Medium | 58.1% | 37.5% | ArrayBreadth-First SearchMatrix |
| Partition Array for Maximum Sum | Medium | 77.3% | 37.5% | ArrayDynamic Programming |
| Greatest Common Divisor of Strings | Easy | 53.4% | 37.5% | MathString |
| Car Pooling | Medium | 56.2% | 37.5% | ArraySortingHeap (Priority Queue)+2 |
| Defanging an IP Address | Easy | 90.0% | 37.5% | String |
| Lowest Common Ancestor of Deepest Leaves | Medium | 79.4% | 37.5% | Hash TableTreeDepth-First Search+2 |
| User Activity for the Past 30 Days I | Easy | 50.5% | 37.5% | Database |
| Article Views I | Easy | 76.7% | 37.5% | Database |
| Kids With the Greatest Number of Candies | Easy | 88.0% | 37.5% | Array |
| Lowest Common Ancestor of a Binary Tree II | Medium | 69.5% | 37.5% | |
| Check If Two String Arrays are Equivalent | Easy | 86.0% | 37.5% | ArrayString |
| Average Time of Process per Machine | Easy | 66.9% | 37.5% | Database |
| Check if Array Is Sorted and Rotated | Easy | 55.7% | 37.5% | Array |
| Shortest Path in a Hidden Grid | Medium | 44.5% | 37.5% | |
| Frequency of the Most Frequent Element | Medium | 44.6% | 37.5% | ArrayBinary SearchGreedy+3 |
| Cutting Ribbons | Medium | 53.0% | 37.5% | |
| Create a DataFrame from List | Easy | 81.1% | 37.5% | |
| Best Time to Buy and Sell Stock III | Hard | 53.1% | 37.5% | ArrayDynamic Programming |
| Unique Binary Search Trees | Medium | 63.3% | 37.5% | MathDynamic ProgrammingTree+2 |
| Simple Bank System | Medium | 69.8% | 37.5% | ArrayHash TableDesign+1 |
| Swap Nodes in Pairs | Medium | 68.9% | 25.0% | Linked ListRecursion |
| Substring with Concatenation of All Words | Hard | 34.0% | 25.0% | Hash TableStringSliding Window |
| Unique Paths II | Medium | 44.1% | 25.0% | ArrayDynamic ProgrammingMatrix |
| Minimum Path Sum | Medium | 67.8% | 25.0% | ArrayDynamic ProgrammingMatrix |
| Edit Distance | Medium | 60.1% | 25.0% | StringDynamic Programming |
| Combinations | Medium | 74.2% | 25.0% | Backtracking |
| Restore IP Addresses | Medium | 55.3% | 25.0% | StringBacktracking |
| Unique Binary Search Trees II | Medium | 61.9% | 25.0% | Dynamic ProgrammingBacktrackingTree+2 |
| Symmetric Tree | Easy | 60.7% | 25.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Convert Sorted Array to Binary Search Tree | Easy | 75.2% | 25.0% | ArrayDivide and ConquerTree+2 |
| Convert Sorted List to Binary Search Tree | Medium | 65.9% | 25.0% | Linked ListDivide and ConquerTree+2 |
| Balanced Binary Tree | Easy | 57.8% | 25.0% | TreeDepth-First SearchBinary Tree |
| Minimum Depth of Binary Tree | Easy | 52.3% | 25.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Path Sum | Easy | 54.4% | 25.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Surrounded Regions | Medium | 44.7% | 25.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Single Number II | Medium | 66.7% | 25.0% | ArrayBit Manipulation |
| Linked List Cycle | Easy | 53.9% | 25.0% | Hash TableLinked ListTwo Pointers |
| Linked List Cycle II | Medium | 57.2% | 25.0% | Hash TableLinked ListTwo Pointers |
| Binary Tree Postorder Traversal | Easy | 77.6% | 25.0% | StackTreeDepth-First Search+1 |
| Max Points on a Line | Hard | 30.2% | 25.0% | ArrayHash TableMath+1 |
| Evaluate Reverse Polish Notation | Medium | 57.0% | 25.0% | ArrayMathStack |
| Read N Characters Given Read4 | Easy | 42.5% | 25.0% | |
| Read N Characters Given read4 II - Call Multiple Times | Hard | 43.2% | 25.0% | |
| One Edit Distance | Medium | 34.5% | 25.0% | |
| Combine Two Tables | Easy | 79.2% | 25.0% | Database |
| Employees Earning More Than Their Managers | Easy | 72.8% | 25.0% | Database |
| Duplicate Emails | Easy | 73.4% | 25.0% | Database |
| Customers Who Never Order | Easy | 71.5% | 25.0% | Database |
| Repeated DNA Sequences | Medium | 52.9% | 25.0% | Hash TableStringBit Manipulation+3 |
| Reverse Bits | Easy | 67.7% | 25.0% | Divide and ConquerBit Manipulation |
| Number of 1 Bits | Easy | 76.3% | 25.0% | Divide and ConquerBit Manipulation |
| Remove Linked List Elements | Easy | 53.8% | 25.0% | Linked ListRecursion |
| Design Add and Search Words Data Structure | Medium | 48.1% | 25.0% | StringDepth-First SearchDesign+1 |
| Word Search II | Hard | 38.1% | 25.0% | ArrayStringBacktracking+2 |
| House Robber II | Medium | 44.6% | 25.0% | ArrayDynamic Programming |
| Invert Binary Tree | Easy | 79.8% | 25.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Summary Ranges | Easy | 53.9% | 25.0% | Array |
| Majority Element II | Medium | 55.8% | 25.0% | ArrayHash TableSorting+1 |
| Search a 2D Matrix II | Medium | 56.8% | 25.0% | ArrayBinary SearchDivide and Conquer+1 |
| Graph Valid Tree | Medium | 49.8% | 25.0% | |
| Paint House II | Hard | 56.9% | 25.0% | |
| Palindrome Permutation | Easy | 68.6% | 25.0% | |
| Encode and Decode Strings | Medium | 51.2% | 25.0% | |
| H-Index | Medium | 41.1% | 25.0% | ArraySortingCounting Sort |
| H-Index II | Medium | 39.4% | 25.0% | ArrayBinary Search |
| Find the Celebrity | Medium | 48.9% | 25.0% | |
| Inorder Successor in BST | Medium | 51.1% | 25.0% | |
| Game of Life | Medium | 72.3% | 25.0% | ArrayMatrixSimulation |
| Word Pattern | Easy | 43.8% | 25.0% | Hash TableString |
| Power of Three | Easy | 50.7% | 25.0% | MathRecursion |
| Reconstruct Itinerary | Hard | 44.3% | 25.0% | ArrayStringDepth-First Search+4 |
| Reverse Vowels of a String | Easy | 60.6% | 25.0% | Two PointersString |
| Intersection of Two Arrays II | Easy | 59.7% | 25.0% | ArrayHash TableTwo Pointers+2 |
| Valid Perfect Square | Easy | 44.7% | 25.0% | MathBinary Search |
| Combination Sum IV | Medium | 55.0% | 25.0% | ArrayDynamic Programming |
| Insert Delete GetRandom O(1) - Duplicates allowed | Hard | 36.4% | 25.0% | ArrayHash TableMath+2 |
| First Unique Character in a String | Easy | 65.0% | 25.0% | Hash TableStringQueue+1 |
| Evaluate Division | Medium | 64.0% | 25.0% | ArrayStringDepth-First Search+4 |
| Sum of Left Leaves | Easy | 62.4% | 25.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Convert a Number to Hexadecimal | Easy | 53.2% | 25.0% | MathStringBit Manipulation |
| Longest Palindrome | Easy | 55.8% | 25.0% | Hash TableStringGreedy |
| Fizz Buzz | Easy | 75.2% | 25.0% | MathStringSimulation |
| Pacific Atlantic Water Flow | Medium | 60.6% | 25.0% | ArrayDepth-First SearchBreadth-First Search+1 |
| Path Sum III | Medium | 46.3% | 25.0% | TreeDepth-First SearchBinary Tree |
| Find All Anagrams in a String | Medium | 53.3% | 25.0% | Hash TableStringSliding Window |
| Find All Duplicates in an Array | Medium | 76.8% | 25.0% | ArrayHash TableSorting |
| Find All Numbers Disappeared in an Array | Easy | 63.7% | 25.0% | ArrayHash Table |
| Delete Node in a BST | Medium | 54.2% | 25.0% | TreeBinary Search TreeBinary Tree |
| Sort Characters By Frequency | Medium | 75.1% | 25.0% | Hash TableStringSorting+3 |
| Assign Cookies | Easy | 54.7% | 25.0% | ArrayTwo PointersGreedy+1 |
| Hamming Distance | Easy | 76.6% | 25.0% | Bit Manipulation |
| Island Perimeter | Easy | 74.2% | 25.0% | ArrayDepth-First SearchBreadth-First Search+1 |
| Validate IP Address | Medium | 28.2% | 25.0% | String |
| Total Hamming Distance | Medium | 54.6% | 25.0% | ArrayMathBit Manipulation |
| Longest Palindromic Subsequence | Medium | 65.1% | 25.0% | StringDynamic Programming |
| Encode and Decode TinyURL | Medium | 86.6% | 25.0% | Hash TableStringDesign+1 |
| 01 Matrix | Medium | 53.3% | 25.0% | ArrayDynamic ProgrammingBreadth-First Search+1 |
| Number of Provinces | Medium | 70.0% | 25.0% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Brick Wall | Medium | 56.0% | 25.0% | ArrayHash Table |
| Get Highest Answer Rate Question | Medium | 40.0% | 25.0% | |
| Friend Requests I: Overall Acceptance Rate | Easy | 41.1% | 25.0% | |
| Triangle Judgement | Easy | 74.5% | 25.0% | Database |
| Add Bold Tag in String | Medium | 51.4% | 25.0% | |
| Merge Two Binary Trees | Easy | 79.0% | 25.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Sum of Square Numbers | Medium | 36.7% | 25.0% | MathTwo PointersBinary Search |
| Average of Levels in Binary Tree | Easy | 74.7% | 25.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Decode Ways II | Hard | 31.7% | 25.0% | StringDynamic Programming |
| Design Search Autocomplete System | Hard | 49.7% | 25.0% | |
| Number of Longest Increasing Subsequence | Medium | 51.3% | 25.0% | ArrayDynamic ProgrammingBinary Indexed Tree+1 |
| Longest Continuous Increasing Subsequence | Easy | 51.8% | 25.0% | Array |
| Valid Parenthesis String | Medium | 39.8% | 25.0% | StringDynamic ProgrammingStack+1 |
| Top K Frequent Words | Medium | 60.0% | 25.0% | ArrayHash TableString+5 |
| Subarray Product Less Than K | Medium | 53.9% | 25.0% | ArrayBinary SearchSliding Window+1 |
| Best Time to Buy and Sell Stock with Transaction Fee | Medium | 71.7% | 25.0% | ArrayDynamic ProgrammingGreedy |
| Flood Fill | Easy | 67.8% | 25.0% | ArrayDepth-First SearchBreadth-First Search+1 |
| Prefix and Suffix Search | Hard | 40.8% | 25.0% | ArrayHash TableString+2 |
| Number Of Corner Rectangles | Medium | 67.9% | 25.0% | |
| Open the Lock | Medium | 61.1% | 25.0% | ArrayHash TableString+1 |
| Largest Plus Sign | Medium | 49.0% | 25.0% | ArrayDynamic Programming |
| Reorganize String | Medium | 56.8% | 25.0% | Hash TableStringGreedy+3 |
| Jewels and Stones | Easy | 89.5% | 25.0% | Hash TableString |
| Cheapest Flights Within K Stops | Medium | 41.4% | 25.0% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+3 |
| Design HashMap | Easy | 66.4% | 25.0% | ArrayHash TableLinked List+2 |
| Minimum Swaps To Make Sequences Increasing | Hard | 41.3% | 25.0% | ArrayDynamic Programming |
| Design Circular Queue | Medium | 54.0% | 25.0% | ArrayLinked ListDesign+1 |
| Groups of Special-Equivalent Strings | Medium | 73.5% | 25.0% | ArrayHash TableString+1 |
| Fruit Into Baskets | Medium | 50.5% | 25.0% | ArrayHash TableSliding Window |
| Sum of Subarray Minimums | Medium | 38.3% | 25.0% | ArrayDynamic ProgrammingStack+1 |
| Sort an Array | Medium | 55.9% | 25.0% | ArrayDivide and ConquerSorting+5 |
| Maximum Sum Circular Subarray | Medium | 49.4% | 25.0% | ArrayDivide and ConquerDynamic Programming+2 |
| Binary Subarrays With Sum | Medium | 68.2% | 25.0% | ArrayHash TableSliding Window+1 |
| Time Based Key-Value Store | Medium | 49.7% | 25.0% | Hash TableStringBinary Search+1 |
| Add to Array-Form of Integer | Easy | 45.4% | 25.0% | ArrayMath |
| Maximum Binary Tree II | Medium | 70.3% | 25.0% | TreeBinary Tree |
| Construct Binary Search Tree from Preorder Traversal | Medium | 84.1% | 25.0% | ArrayStackTree+3 |
| Remove Outermost Parentheses | Easy | 86.8% | 25.0% | StringStack |
| Moving Stones Until Consecutive | Medium | 52.1% | 25.0% | MathBrainteaser |
| Moving Stones Until Consecutive II | Medium | 58.7% | 25.0% | ArrayMathSliding Window+1 |
| Maximum Level Sum of a Binary Tree | Medium | 70.0% | 25.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Minimum Knight Moves | Medium | 41.7% | 25.0% | |
| Intersection of Three Sorted Arrays | Easy | 80.0% | 25.0% | |
| Product Sales Analysis III | Medium | 45.6% | 25.0% | Database |
| Project Employees I | Easy | 66.5% | 25.0% | Database |
| Project Employees II | Easy | 50.4% | 25.0% | |
| Project Employees III | Medium | 77.1% | 25.0% | |
| Delete Nodes And Return Forest | Medium | 72.5% | 25.0% | ArrayHash TableTree+2 |
| Reported Posts | Easy | 64.8% | 25.0% | |
| Element Appearing More Than 25% In Sorted Array | Easy | 61.1% | 25.0% | Array |
| Reported Posts II | Medium | 32.0% | 25.0% | |
| User Activity for the Past 30 Days II | Easy | 35.6% | 25.0% | |
| Longest Common Subsequence | Medium | 58.9% | 25.0% | StringDynamic Programming |
| Rank Transform of an Array | Easy | 70.8% | 25.0% | ArrayHash TableSorting |
| Web Crawler | Medium | 68.9% | 25.0% | |
| Validate Binary Tree Nodes | Medium | 44.1% | 25.0% | TreeDepth-First SearchBreadth-First Search+3 |
| Balance a Binary Search Tree | Medium | 86.3% | 25.0% | Divide and ConquerGreedyTree+3 |
| Number of Visible People in a Queue | Hard | 72.3% | 25.0% | ArrayStackMonotonic Stack |
| Unique Number of Occurrences | Easy | 78.6% | 25.0% | ArrayHash Table |
| Design Skiplist | Hard | 59.1% | 25.0% | Linked ListDesign |
| Queries Quality and Percentage | Easy | 52.2% | 25.0% | Database |
| Report Contiguous Dates | Hard | 57.1% | 25.0% | |
| Maximum Length of a Concatenated String with Unique Characters | Medium | 54.6% | 25.0% | ArrayStringBacktracking+1 |
| Web Crawler Multithreaded | Medium | 51.0% | 25.0% | |
| Leftmost Column with at Least a One | Medium | 55.1% | 25.0% | |
| Number of Comments per Post | Easy | 65.6% | 25.0% | |
| Calculate Amount Paid in Taxes | Easy | 69.0% | 25.0% | ArraySimulation |
| Average Selling Price | Easy | 37.1% | 25.0% | Database |
| Minimum Time Visiting All Points | Easy | 84.8% | 25.0% | ArrayMathGeometry |
| Page Recommendations | Medium | 65.4% | 25.0% | |
| Ads Performance | Easy | 58.7% | 25.0% | |
| Apply Discount Every n Orders | Medium | 65.3% | 25.0% | ArrayHash TableDesign |
| Number of Substrings Containing All Three Characters | Medium | 73.5% | 25.0% | Hash TableStringSliding Window |
| Count Negative Numbers in a Sorted Matrix | Easy | 79.5% | 25.0% | ArrayBinary SearchMatrix |
| Product of the Last K Numbers | Medium | 62.9% | 25.0% | ArrayMathDesign+2 |
| Maximum Number of Events That Can Be Attended | Medium | 38.9% | 25.0% | ArrayGreedySorting+1 |
| Find a Corresponding Node of a Binary Tree in a Clone of That Tree | Easy | 85.8% | 25.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Replace Employee ID With The Unique Identifier | Easy | 83.5% | 25.0% | Database |
| Customers Who Bought Products A and B but Not C | Medium | 71.5% | 25.0% | |
| Find the Kth Smallest Sum of a Matrix With Sorted Rows | Hard | 62.3% | 25.0% | ArrayBinary SearchHeap (Priority Queue)+1 |
| Make Two Arrays Equal by Reversing Subarrays | Easy | 75.8% | 25.0% | ArrayHash TableSorting |
| Maximum Number of Darts Inside of a Circular Dartboard | Hard | 40.1% | 25.0% | ArrayMathGeometry |
| Apples & Oranges | Medium | 86.0% | 25.0% | |
| Longest Subarray of 1's After Deleting One Element | Medium | 71.0% | 25.0% | ArrayDynamic ProgrammingSliding Window |
| Running Sum of 1d Array | Easy | 86.9% | 25.0% | ArrayPrefix Sum |
| Minimum Number of Days to Make m Bouquets | Medium | 56.2% | 25.0% | ArrayBinary Search |
| Number of Subsequences That Satisfy the Given Sum Condition | Medium | 49.3% | 25.0% | ArrayTwo PointersBinary Search+1 |
| Diameter of N-Ary Tree | Medium | 75.4% | 25.0% | |
| Customer Who Visited but Did Not Make Any Transactions | Easy | 67.6% | 25.0% | Database |
| Binary Search Tree Iterator II | Medium | 63.3% | 25.0% | |
| Maximum Nesting Depth of the Parentheses | Easy | 84.8% | 25.0% | StringStack |
| Max Number of K-Sum Pairs | Medium | 56.9% | 25.0% | ArrayHash TableTwo Pointers+1 |
| Construct the Lexicographically Largest Valid Sequence | Medium | 72.8% | 25.0% | ArrayBacktracking |
| Invalid Tweets | Easy | 85.2% | 25.0% | Database |
| Sum of Unique Elements | Easy | 79.8% | 25.0% | ArrayHash TableCounting |
| Count Items Matching a Rule | Easy | 85.3% | 25.0% | ArrayString |
| Check if One String Swap Can Make Strings Equal | Easy | 49.5% | 25.0% | Hash TableStringCounting |
| Minimum Path Cost in a Hidden Grid | Medium | 58.7% | 25.0% | |
| Faulty Sensor | Easy | 50.5% | 25.0% | |
| Nearest Exit from Entrance in Maze | Medium | 48.3% | 25.0% | ArrayBreadth-First SearchMatrix |
| Minimum Cost to Reach Destination in Time | Hard | 41.1% | 25.0% | ArrayDynamic ProgrammingGraph Theory |
| Page Recommendations II | Hard | 45.5% | 25.0% | |
| Build Array from Permutation | Easy | 91.1% | 25.0% | ArraySimulation |
| Count Good Numbers | Medium | 57.4% | 25.0% | MathRecursion |
| Concatenation of Array | Easy | 90.5% | 25.0% | ArraySimulation |
| Maximum Compatibility Score Sum | Medium | 64.3% | 25.0% | ArrayDynamic ProgrammingBacktracking+2 |
| Confirmation Rate | Medium | 61.6% | 25.0% | Database |
| Number of Ways to Arrive at Destination | Medium | 37.3% | 25.0% | Dynamic ProgrammingGraph TheoryTopological Sort+1 |
| Strong Friendship | Medium | 54.4% | 25.0% | |
| Count Nodes Equal to Sum of Descendants | Medium | 77.4% | 25.0% | |
| Longest Subsequence Repeated k Times | Hard | 71.3% | 25.0% | Hash TableTwo PointersString+3 |
| K Radius Subarray Averages | Medium | 46.0% | 25.0% | ArraySliding Window |
| Rearrange Array Elements by Sign | Medium | 84.5% | 25.0% | ArrayTwo PointersSimulation |
| Count Hills and Valleys in an Array | Easy | 69.1% | 25.0% | Array |
| Finding the Topic of Each Post | Hard | 50.2% | 25.0% | |
| Steps to Make Array Non-decreasing | Medium | 24.6% | 25.0% | ArrayLinked ListDynamic Programming+3 |
| Task Scheduler II | Medium | 54.7% | 25.0% | ArrayHash TableSimulation |
| Words Within Two Edits of Dictionary | Medium | 61.7% | 25.0% | ArrayStringTrie |
| Separate the Digits in an Array | Easy | 80.8% | 25.0% | ArraySimulation |
| Check Knight Tour Configuration | Medium | 60.5% | 25.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| To Be Or Not To Be | Easy | 63.3% | 25.0% | |
| Count Pairs Whose Sum is Less than Target | Easy | 87.7% | 25.0% | ArrayTwo PointersBinary Search+1 |
| Remove Duplicates from Sorted List II | Medium | 51.3% | 25.0% | Linked ListTwo Pointers |
| Partition List | Medium | 60.6% | 25.0% | Linked ListTwo Pointers |
| Count Complete Tree Nodes | Easy | 72.0% | 25.0% | Binary SearchBit ManipulationTree+1 |
| Lemonade Change | Easy | 58.9% | 25.0% | ArrayGreedy |
| Find Duplicate File in System | Medium | 67.6% | 25.0% | ArrayHash TableString |
| Triangle | Medium | 59.8% | 25.0% | ArrayDynamic Programming |
| Movie Rating | Medium | 42.7% | 25.0% | Database |
| Employee Bonus | Easy | 77.1% | 25.0% | Database |
| Find Winner on a Tic Tac Toe Game | Easy | 54.5% | 25.0% | ArrayHash TableMatrix+1 |
| Students and Examinations | Easy | 60.9% | 25.0% | Database |
| Minimum Time Difference | Medium | 62.5% | 25.0% | ArrayMathString+1 |
| Minimum Falling Path Sum | Medium | 60.8% | 25.0% | ArrayDynamic ProgrammingMatrix |
| Lexicographical Numbers | Medium | 76.2% | 25.0% | Depth-First SearchTrie |
| Find the Length of the Longest Common Prefix | Medium | 57.0% | 25.0% | ArrayHash TableString+1 |
| N-Queens II | Hard | 78.1% | 25.0% | Backtracking |
| Check if the Sentence Is Pangram | Easy | 84.1% | 25.0% | Hash TableString |
| Remove Sub-Folders from the Filesystem | Medium | 78.6% | 25.0% | ArrayStringDepth-First Search+1 |
| Number of Recent Calls | Easy | 78.1% | 25.0% | DesignQueueData Stream |
| Remove Duplicates from Sorted List | Easy | 56.2% | 25.0% | Linked List |
| Redundant Connection | Medium | 67.2% | 25.0% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Count Binary Substrings | Easy | 70.2% | 25.0% | Two PointersString |
| Find the Smallest Divisor Given a Threshold | Medium | 65.4% | 25.0% | ArrayBinary Search |
| Inorder Successor in BST II | Medium | 61.1% | 25.0% | |
| Min Cost Climbing Stairs | Easy | 68.0% | 25.0% | ArrayDynamic Programming |
| Implement Stack using Queues | Easy | 69.3% | 25.0% | StackDesignQueue |
| Online Stock Span | Medium | 68.7% | 25.0% | StackDesignMonotonic Stack+1 |
| Identify the Largest Outlier in an Array | Medium | 36.2% | 25.0% | ArrayHash TableCounting+1 |
| Largest Odd Number in String | Easy | 66.9% | 25.0% | MathStringGreedy |
| Reverse String II | Easy | 53.3% | 25.0% | Two PointersString |
| Maximum Score After Splitting a String | Easy | 65.1% | 25.0% | StringPrefix Sum |
| Shifting Letters II | Medium | 53.5% | 25.0% | ArrayStringPrefix Sum |
| Find the Prefix Common Array of Two Arrays | Medium | 87.0% | 25.0% | ArrayHash TableBit Manipulation |
| Unique Paths III | Hard | 82.7% | 25.0% | ArrayBacktrackingBit Manipulation+1 |
| Find Eventual Safe States | Medium | 70.3% | 25.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Immediate Food Delivery II | Medium | 55.6% | 25.0% | Database |
| Transpose Matrix | Easy | 75.9% | 25.0% | ArrayMatrixSimulation |
| Monthly Transactions I | Medium | 58.9% | 25.0% | Database |
| Fraction to Recurring Decimal | Medium | 30.5% | 25.0% | Hash TableMathString |
| Find Missing and Repeated Values | Easy | 83.3% | 25.0% | ArrayHash TableMath+1 |
| Distinct Subsequences | Hard | 51.5% | 25.0% | StringDynamic Programming |
| Largest Divisible Subset | Medium | 49.4% | 25.0% | ArrayMathDynamic Programming+1 |
| Russian Doll Envelopes | Hard | 37.7% | 25.0% | ArrayBinary SearchDynamic Programming+1 |
| Maximum Points You Can Obtain from Cards | Medium | 57.2% | 25.0% | ArraySliding WindowPrefix Sum |
| Find the Most Common Response | Medium | 75.0% | 25.0% | ArrayHash TableString+1 |
| Find Numbers with Even Number of Digits | Easy | 79.6% | 25.0% | ArrayMath |
| Longest Substring with At Most Two Distinct Characters | Medium | 57.0% | 25.0% | |
| Find the K-th Character in String Game I | Easy | 81.6% | 25.0% | MathBit ManipulationRecursion+1 |
| Minimum Deletions for At Most K Distinct Characters | Easy | 72.9% | 25.0% | Hash TableStringGreedy+2 |
| Coin Change II | Medium | 60.5% | 25.0% | ArrayDynamic Programming |
| Fruits Into Baskets II | Easy | 70.2% | 25.0% | ArrayBinary SearchSegment Tree+2 |
| Threshold Majority Queries | Hard | 21.7% | 25.0% | ArrayHash TableBinary Search+3 |
| Bitwise OR of Even Numbers in an Array | Easy | 84.7% | 25.0% | ArrayBit ManipulationSimulation |
| Minimum Cost Path with Edge Reversals | Medium | 61.8% | 25.0% | Graph TheoryHeap (Priority Queue)Shortest Path |
| Design Ride Sharing System | Medium | 63.2% | 25.0% | Hash TableDesignQueue+1 |
| Permutations II | Medium | 62.9% | 12.5% | ArrayBacktrackingSorting |
| Spiral Matrix II | Medium | 74.6% | 12.5% | ArrayMatrixSimulation |
| Binary Tree Level Order Traversal II | Medium | 67.6% | 12.5% | TreeBreadth-First SearchBinary Tree |
| Pascal's Triangle II | Easy | 67.1% | 12.5% | ArrayDynamic Programming |
| Binary Tree Preorder Traversal | Easy | 75.1% | 12.5% | StackTreeDepth-First Search+1 |
| Factorial Trailing Zeroes | Medium | 46.1% | 12.5% | Math |
| Dungeon Game | Hard | 40.8% | 12.5% | ArrayDynamic ProgrammingMatrix |
| Consecutive Numbers | Medium | 47.8% | 12.5% | Database |
| Department Highest Salary | Medium | 57.3% | 12.5% | Database |
| Department Top Three Salaries | Hard | 59.8% | 12.5% | Database |
| Best Time to Buy and Sell Stock IV | Hard | 49.5% | 12.5% | ArrayDynamic Programming |
| Rectangle Area | Medium | 48.9% | 12.5% | MathGeometry |
| Implement Queue using Stacks | Easy | 69.3% | 12.5% | StackDesignQueue |
| Number of Digit One | Hard | 37.7% | 12.5% | MathDynamic ProgrammingRecursion |
| Different Ways to Add Parentheses | Medium | 73.1% | 12.5% | MathStringDynamic Programming+2 |
| Single Number III | Medium | 70.4% | 12.5% | ArrayBit Manipulation |
| Trips and Users | Hard | 37.7% | 12.5% | Database |
| Palindrome Permutation II | Medium | 42.3% | 12.5% | |
| Best Meeting Point | Hard | 61.4% | 12.5% | |
| Bulls and Cows | Medium | 52.2% | 12.5% | Hash TableStringCounting |
| Minimum Height Trees | Medium | 42.4% | 12.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Remove Duplicate Letters | Medium | 52.8% | 12.5% | StringStackGreedy+1 |
| Bulb Switcher | Medium | 55.5% | 12.5% | MathBrainteaser |
| Number of Connected Components in an Undirected Graph | Medium | 64.8% | 12.5% | |
| Patching Array | Hard | 54.1% | 12.5% | ArrayGreedy |
| House Robber III | Medium | 55.6% | 12.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Counting Bits | Easy | 80.4% | 12.5% | Dynamic ProgrammingBit Manipulation |
| Power of Four | Easy | 51.7% | 12.5% | MathBit ManipulationRecursion |
| Integer Break | Medium | 61.8% | 12.5% | MathDynamic Programming |
| Sum of Two Integers | Medium | 55.0% | 12.5% | MathBit Manipulation |
| Find K Pairs with Smallest Sums | Medium | 41.5% | 12.5% | ArrayHeap (Priority Queue) |
| Shuffle an Array | Medium | 59.5% | 12.5% | ArrayMathDesign+1 |
| Longest Absolute File Path | Medium | 49.2% | 12.5% | StringStackDepth-First Search |
| Find the Difference | Easy | 60.1% | 12.5% | Hash TableStringBit Manipulation+1 |
| UTF-8 Validation | Medium | 46.0% | 12.5% | ArrayBit Manipulation |
| Queue Reconstruction by Height | Medium | 74.6% | 12.5% | ArrayBinary Indexed TreeSegment Tree+1 |
| Trapping Rain Water II | Hard | 64.0% | 12.5% | ArrayBreadth-First SearchHeap (Priority Queue)+1 |
| Add Two Numbers II | Medium | 62.4% | 12.5% | Linked ListMathStack |
| 132 Pattern | Medium | 34.5% | 12.5% | ArrayBinary SearchStack+2 |
| LFU Cache | Hard | 48.6% | 12.5% | Hash TableLinked ListDesign+1 |
| Find Mode in Binary Search Tree | Easy | 58.5% | 12.5% | TreeDepth-First SearchBinary Search Tree+1 |
| IPO | Hard | 53.3% | 12.5% | ArrayGreedySorting+1 |
| Find Largest Value in Each Tree Row | Medium | 66.3% | 12.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Swapping Nodes in a Linked List | Medium | 69.2% | 12.5% | Linked ListTwo Pointers |
| Minimum Absolute Difference in BST | Easy | 59.2% | 12.5% | TreeDepth-First SearchBreadth-First Search+2 |
| Shortest Path to Get Food | Medium | 57.1% | 12.5% | |
| Array Partition | Easy | 81.5% | 12.5% | ArrayGreedySorting+1 |
| Human Traffic of Stadium | Hard | 50.8% | 12.5% | Database |
| Add One Row to Tree | Medium | 64.1% | 12.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Maximum Product of Three Numbers | Easy | 45.7% | 12.5% | ArrayMathSorting |
| Set Mismatch | Easy | 44.2% | 12.5% | ArrayHash TableBit Manipulation+1 |
| Dota2 Senate | Medium | 49.6% | 12.5% | StringGreedyQueue |
| Maximum Width of Binary Tree | Medium | 45.2% | 12.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Implement Magic Dictionary | Medium | 57.7% | 12.5% | Hash TableStringDepth-First Search+2 |
| Baseball Game | Easy | 80.0% | 12.5% | ArrayStackSimulation |
| Redundant Connection II | Hard | 35.9% | 12.5% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Longest Univalue Path | Medium | 43.5% | 12.5% | TreeDepth-First SearchBinary Tree |
| Knight Probability in Chessboard | Medium | 56.9% | 12.5% | Dynamic Programming |
| Number of Distinct Islands | Medium | 62.7% | 12.5% | |
| Partition to K Equal Sum Subsets | Medium | 38.4% | 12.5% | ArrayDynamic ProgrammingBacktracking+3 |
| Number of Distinct Islands II | Hard | 55.3% | 12.5% | |
| Range Module | Hard | 44.7% | 12.5% | DesignSegment TreeOrdered Set |
| Candy Crush | Medium | 77.3% | 12.5% | |
| Minimum Window Subsequence | Hard | 43.8% | 12.5% | |
| Flatten a Multilevel Doubly Linked List | Medium | 62.5% | 12.5% | Linked ListDepth-First SearchDoubly-Linked List |
| Partition Labels | Medium | 81.8% | 12.5% | Hash TableTwo PointersString+1 |
| Search in a Binary Search Tree | Easy | 82.5% | 12.5% | TreeBinary Search TreeBinary Tree |
| Basic Calculator III | Hard | 53.1% | 12.5% | |
| K-th Symbol in Grammar | Medium | 48.1% | 12.5% | MathBit ManipulationRecursion |
| All Paths From Source to Target | Medium | 83.5% | 12.5% | BacktrackingDepth-First SearchBreadth-First Search+1 |
| Design HashSet | Easy | 67.7% | 12.5% | ArrayHash TableLinked List+2 |
| Bus Routes | Hard | 47.1% | 12.5% | ArrayHash TableBreadth-First Search |
| Most Common Word | Easy | 45.0% | 12.5% | ArrayHash TableString+1 |
| Most Profit Assigning Work | Medium | 56.1% | 12.5% | ArrayTwo PointersBinary Search+2 |
| Rectangle Overlap | Easy | 46.4% | 12.5% | MathGeometry |
| Backspace String Compare | Easy | 49.8% | 12.5% | Two PointersStringStack+1 |
| Hand of Straights | Medium | 57.8% | 12.5% | ArrayHash TableGreedy+1 |
| Minimum Cost to Hire K Workers | Hard | 63.6% | 12.5% | ArrayGreedySorting+1 |
| Shortest Subarray with Sum at Least K | Hard | 32.6% | 12.5% | ArrayBinary SearchQueue+4 |
| Leaf-Similar Trees | Easy | 70.2% | 12.5% | TreeDepth-First SearchBinary Tree |
| Boats to Save People | Medium | 61.4% | 12.5% | ArrayTwo PointersGreedy+1 |
| Complete Binary Tree Inserter | Medium | 65.0% | 12.5% | TreeBreadth-First SearchDesign+1 |
| Subarray Sums Divisible by K | Medium | 56.0% | 12.5% | ArrayHash TablePrefix Sum |
| Subarrays with K Different Integers | Hard | 67.5% | 12.5% | ArrayHash TableSliding Window+1 |
| Cousins in Binary Tree | Easy | 59.1% | 12.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Minimum Number of K Consecutive Bit Flips | Hard | 62.2% | 12.5% | ArrayBit ManipulationQueue+2 |
| Find Common Characters | Easy | 74.6% | 12.5% | ArrayHash TableString |
| Partition Array Into Three Parts With Equal Sum | Easy | 42.5% | 12.5% | ArrayGreedy |
| Maximum Difference Between Node and Ancestor | Medium | 78.1% | 12.5% | TreeDepth-First SearchBinary Tree |
| Recover a Tree From Preorder Traversal | Hard | 83.2% | 12.5% | StringTreeDepth-First Search+1 |
| Two City Scheduling | Medium | 68.3% | 12.5% | ArrayGreedySorting |
| Last Stone Weight | Easy | 66.3% | 12.5% | ArrayHeap (Priority Queue) |
| Height Checker | Easy | 81.5% | 12.5% | ArraySortingCounting Sort |
| Grumpy Bookstore Owner | Medium | 64.0% | 12.5% | ArraySliding Window |
| Shortest Common Supersequence | Hard | 61.7% | 12.5% | StringDynamic Programming |
| Tree Diameter | Medium | 61.2% | 12.5% | |
| Game Play Analysis IV | Medium | 40.7% | 12.5% | Database |
| Find in Mountain Array | Hard | 41.1% | 12.5% | ArrayBinary SearchInteractive |
| Parsing A Boolean Expression | Hard | 69.8% | 12.5% | StringStackRecursion |
| Relative Sort Array | Easy | 75.1% | 12.5% | ArrayHash TableSorting+1 |
| N-th Tribonacci Number | Easy | 63.3% | 12.5% | MathDynamic ProgrammingMemoization |
| Sum of Nodes with Even-Valued Grandparent | Medium | 85.9% | 12.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Snapshot Array | Medium | 36.7% | 12.5% | ArrayHash TableBinary Search+1 |
| Number of Dice Rolls With Target Sum | Medium | 62.2% | 12.5% | Dynamic Programming |
| Remove Zero Sum Consecutive Nodes from Linked List | Medium | 53.1% | 12.5% | Hash TableLinked List |
| Maximum Candies Allocated to K Children | Medium | 49.9% | 12.5% | ArrayBinary Search |
| First Unique Number | Medium | 57.0% | 12.5% | |
| Count Number of Nice Subarrays | Medium | 74.8% | 12.5% | ArrayHash TableMath+2 |
| Number of Closed Islands | Medium | 67.0% | 12.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Maximum Score Words Formed by Letters | Hard | 81.6% | 12.5% | ArrayHash TableString+5 |
| Search Suggestions System | Medium | 65.2% | 12.5% | ArrayStringBinary Search+3 |
| Subtract the Product and Sum of Digits of an Integer | Easy | 86.5% | 12.5% | Math |
| Convert Binary Number in a Linked List to Integer | Easy | 82.3% | 12.5% | Linked ListMath |
| Shortest Path in a Grid with Obstacles Elimination | Hard | 46.1% | 12.5% | ArrayBreadth-First SearchMatrix |
| All Elements in Two Binary Search Trees | Medium | 80.2% | 12.5% | TreeDepth-First SearchBinary Search Tree+2 |
| Decrypt String from Alphabet to Integer Mapping | Easy | 80.5% | 12.5% | String |
| Minimum Insertion Steps to Make a String Palindrome | Hard | 73.6% | 12.5% | StringDynamic Programming |
| Angle Between Hands of a Clock | Medium | 64.4% | 12.5% | Math |
| Reduce Array Size to The Half | Medium | 69.3% | 12.5% | ArrayHash TableGreedy+2 |
| Maximum Sum BST in Binary Tree | Hard | 46.4% | 12.5% | Dynamic ProgrammingTreeDepth-First Search+2 |
| Cinema Seat Allocation | Medium | 43.6% | 12.5% | ArrayHash TableGreedy+1 |
| Count Good Nodes in Binary Tree | Medium | 73.8% | 12.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Destination City | Easy | 79.5% | 12.5% | ArrayHash TableString |
| Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | 57.3% | 12.5% | ArrayQueueSliding Window+3 |
| The kth Factor of n | Medium | 70.2% | 12.5% | MathNumber Theory |
| Number of Good Pairs | Easy | 89.8% | 12.5% | ArrayHash TableMath+1 |
| Minimum Insertions to Balance a Parentheses String | Medium | 53.5% | 12.5% | StringStackGreedy |
| Find Users With Valid E-Mails | Easy | 36.8% | 12.5% | Database |
| Crawler Log Folder | Easy | 71.6% | 12.5% | ArrayStringStack |
| Special Array With X Elements Greater Than or Equal X | Easy | 66.8% | 12.5% | ArrayBinary SearchSorting |
| Path With Minimum Effort | Medium | 62.8% | 12.5% | ArrayBinary SearchDepth-First Search+4 |
| Merge In Between Linked Lists | Medium | 82.8% | 12.5% | Linked List |
| Average Waiting Time | Medium | 73.1% | 12.5% | ArraySimulation |
| Count of Matches in Tournament | Easy | 86.3% | 12.5% | MathSimulation |
| The Number of Employees Which Report to Each Employee | Easy | 53.0% | 12.5% | Database |
| Sum of Beauty of All Substrings | Medium | 73.5% | 12.5% | Hash TableStringCounting |
| Primary Department for Each Employee | Easy | 73.9% | 12.5% | Database |
| Find the Winner of the Circular Game | Medium | 82.2% | 12.5% | ArrayMathRecursion+2 |
| Maximum Population Year | Easy | 63.6% | 12.5% | ArrayCountingPrefix Sum |
| Minimize Maximum Pair Sum in Array | Medium | 83.3% | 12.5% | ArrayTwo PointersGreedy+1 |
| Sum of All Subset XOR Totals | Easy | 90.1% | 12.5% | ArrayMathBacktracking+3 |
| Egg Drop With 2 Eggs and N Floors | Medium | 74.6% | 12.5% | MathDynamic Programming |
| Number of Wonderful Substrings | Medium | 66.6% | 12.5% | Hash TableStringBit Manipulation+1 |
| Find a Peak Element II | Medium | 54.4% | 12.5% | ArrayBinary SearchMatrix |
| Unique Length-3 Palindromic Subsequences | Medium | 73.8% | 12.5% | Hash TableStringBit Manipulation+1 |
| Minimum Number of Swaps to Make the String Balanced | Medium | 78.1% | 12.5% | Two PointersStringStack+1 |
| Find All Groups of Farmland | Medium | 75.5% | 12.5% | ArrayDepth-First SearchBreadth-First Search+1 |
| Find Unique Binary String | Medium | 79.4% | 12.5% | ArrayHash TableString+1 |
| Find if Path Exists in Graph | Easy | 54.7% | 12.5% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Final Value of Variable After Performing Operations | Easy | 90.6% | 12.5% | ArrayStringSimulation |
| Minimum Number of Moves to Seat Everyone | Easy | 87.2% | 12.5% | ArrayGreedySorting+1 |
| Check if an Original String Exists Given Two Encoded Strings | Hard | 43.5% | 12.5% | StringDynamic Programming |
| Time Needed to Buy Tickets | Easy | 72.1% | 12.5% | ArrayQueueSimulation |
| Valid Arrangement of Pairs | Hard | 66.5% | 12.5% | ArrayDepth-First SearchGraph Theory+1 |
| Step-By-Step Directions From a Binary Tree Node to Another | Medium | 56.4% | 12.5% | StringTreeDepth-First Search+1 |
| Adding Spaces to a String | Medium | 71.8% | 12.5% | ArrayTwo PointersString+1 |
| Smallest Value of the Rearranged Number | Medium | 53.4% | 12.5% | MathSorting |
| Sum of Total Strength of Wizards | Hard | 29.1% | 12.5% | ArrayStackMonotonic Stack+1 |
| Root Equals Sum of Children | Easy | 84.8% | 12.5% | TreeBinary Tree |
| Count Subarrays With Score Less Than K | Hard | 62.3% | 12.5% | ArrayBinary SearchSliding Window+1 |
| Number of Arithmetic Triplets | Easy | 85.4% | 12.5% | ArrayHash TableTwo Pointers+1 |
| Largest Local Values in a Matrix | Easy | 87.7% | 12.5% | ArrayMatrix |
| Sort the People | Easy | 84.8% | 12.5% | ArrayHash TableString+1 |
| Count Subarrays With Fixed Bounds | Hard | 69.3% | 12.5% | ArrayQueueSliding Window+1 |
| Maximum Sum of Distinct Subarrays With Length K | Medium | 42.8% | 12.5% | ArrayHash TableSliding Window |
| Convert the Temperature | Easy | 90.3% | 12.5% | Math |
| Split Message Based on Limit | Hard | 42.0% | 12.5% | StringEnumeration |
| Find the Pivot Integer | Easy | 83.8% | 12.5% | MathPrefix Sum |
| Remove Nodes From Linked List | Medium | 74.8% | 12.5% | Linked ListStackRecursion+1 |
| Design Memory Allocator | Medium | 49.6% | 12.5% | ArrayHash TableDesign+1 |
| Number of Even and Odd Bits | Easy | 73.3% | 12.5% | Bit Manipulation |
| Mice and Cheese | Medium | 48.2% | 12.5% | ArrayGreedySorting+1 |
| Counter | Easy | 82.4% | 12.5% | |
| Array Prototype Last | Easy | 74.6% | 12.5% | |
| Debounce | Medium | 91.8% | 12.5% | |
| Apply Transform Over Each Element in Array | Easy | 86.2% | 12.5% | |
| Event Emitter | Medium | 74.9% | 12.5% | |
| Find Common Elements Between Two Arrays | Easy | 84.4% | 12.5% | ArrayHash Table |
| Count Subarrays Where Max Element Appears at Least K Times | Medium | 62.4% | 12.5% | ArraySliding Window |
| Length of Longest Subarray With at Most K Frequency | Medium | 56.4% | 12.5% | ArrayHash TableSliding Window |
| Count Elements With Maximum Frequency | Easy | 79.8% | 12.5% | ArrayHash TableCounting |
| Count Alternating Subarrays | Medium | 57.3% | 12.5% | ArrayMath |
| Find the Integer Added to Array II | Medium | 32.8% | 12.5% | ArrayTwo PointersSorting+1 |
| Find the Number of Good Pairs II | Medium | 26.6% | 12.5% | ArrayHash Table |
| Find the Maximum Length of Valid Subsequence II | Medium | 57.2% | 12.5% | ArrayDynamic Programming |
| Ugly Number II | Medium | 49.5% | 12.5% | Hash TableMathDynamic Programming+1 |
| Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | 72.1% | 12.5% | Dynamic ProgrammingGraph TheoryShortest Path |
| Length of the Longest Subsequence That Sums to Target | Medium | 39.3% | 12.5% | ArrayDynamic Programming |
| Minimum Sum of Four Digit Number After Splitting Digits | Easy | 86.2% | 12.5% | MathGreedySorting |
| Count Number of Teams | Medium | 70.2% | 12.5% | ArrayDynamic ProgrammingBinary Indexed Tree+1 |
| Alternating Groups I | Easy | 68.8% | 12.5% | ArraySliding Window |
| Peeking Iterator | Medium | 61.2% | 12.5% | ArrayDesignIterator |
| Burst Balloons | Hard | 62.9% | 12.5% | ArrayDynamic Programming |
| Number of Senior Citizens | Easy | 81.3% | 12.5% | ArrayString |
| Minimum Number of Pushes to Type Word II | Medium | 80.0% | 12.5% | Hash TableStringGreedy+2 |
| Shortest Unsorted Continuous Subarray | Medium | 38.0% | 12.5% | ArrayTwo PointersStack+3 |
| Customers Who Bought All Products | Medium | 63.7% | 12.5% | Database |
| Spiral Matrix III | Medium | 84.5% | 12.5% | ArrayMatrixSimulation |
| Regions Cut By Slashes | Medium | 77.5% | 12.5% | ArrayHash TableDepth-First Search+3 |
| Sum of Subarray Ranges | Medium | 60.7% | 12.5% | ArrayStackMonotonic Stack |
| Stone Game II | Medium | 72.9% | 12.5% | ArrayMathDynamic Programming+2 |
| Permutation Sequence | Hard | 52.1% | 12.5% | MathRecursion |
| Maximum Count of Positive Integer and Negative Integer | Easy | 74.3% | 12.5% | ArrayBinary SearchCounting |
| Longest Substring with At Most K Distinct Characters | Medium | 49.9% | 12.5% | |
| Ugly Number | Easy | 43.1% | 12.5% | Math |
| Minimum Number of Operations to Make Array XOR Equal to K | Medium | 85.5% | 12.5% | ArrayBit Manipulation |
| Delete Duplicate Emails | Easy | 65.6% | 12.5% | Database |
| Path with Maximum Probability | Medium | 65.5% | 12.5% | ArrayGraph TheoryHeap (Priority Queue)+1 |
| Consecutive Characters | Easy | 60.3% | 12.5% | String |
| Find Closest Number to Zero | Easy | 47.7% | 12.5% | Array |
| Employees Whose Manager Left the Company | Easy | 48.6% | 12.5% | Database |
| Convert 1D Array Into 2D Array | Easy | 72.1% | 12.5% | ArrayMatrixSimulation |
| Guess the Word | Hard | 36.9% | 12.5% | ArrayMathString+2 |
| Sum of Digits of String After Convert | Easy | 74.8% | 12.5% | StringSimulation |
| Base 7 | Easy | 53.8% | 12.5% | MathString |
| Count Largest Group | Easy | 74.7% | 12.5% | Hash TableMathCounting |
| Even Odd Tree | Medium | 67.0% | 12.5% | TreeBreadth-First SearchBinary Tree |
| Split Linked List in Parts | Medium | 70.5% | 12.5% | Linked List |
| Find Words That Can Be Formed by Characters | Easy | 71.5% | 12.5% | ArrayHash TableString+1 |
| Score of a String | Easy | 91.4% | 12.5% | String |
| Insert Greatest Common Divisors in Linked List | Medium | 91.5% | 12.5% | Linked ListMathNumber Theory |
| Design In-Memory File System | Hard | 48.4% | 12.5% | |
| Product Price at a Given Date | Medium | 57.7% | 12.5% | Database |
| K Inverse Pairs Array | Hard | 49.0% | 12.5% | Dynamic Programming |
| Guess Number Higher or Lower | Easy | 57.1% | 12.5% | Binary SearchInteractive |
| Maximum Sum of Subsequence With Non-adjacent Elements | Hard | 15.4% | 12.5% | ArrayDivide and ConquerDynamic Programming+1 |
| Longest Subarray With Maximum Bitwise AND | Medium | 65.4% | 12.5% | ArrayBit ManipulationBrainteaser |
| Find the Longest Substring Containing Vowels in Even Counts | Medium | 75.7% | 12.5% | Hash TableStringBit Manipulation+1 |
| Shortest Way to Form String | Medium | 61.5% | 12.5% | |
| Count the Number of Substrings With Dominant Ones | Medium | 42.1% | 12.5% | StringEnumeration |
| Maximum Total Damage With Spell Casting | Medium | 45.0% | 12.5% | ArrayHash TableTwo Pointers+4 |
| Shortest Palindrome | Hard | 41.8% | 12.5% | StringRolling HashString Matching+1 |
| Fix Names in a Table | Easy | 60.6% | 12.5% | Database |
| K-th Smallest in Lexicographical Order | Hard | 46.2% | 12.5% | Trie |
| Extra Characters in a String | Medium | 57.3% | 12.5% | ArrayHash TableString+2 |
| Final Prices With a Special Discount in a Shop | Easy | 84.0% | 12.5% | ArrayStackMonotonic Stack |
| Remove Covered Intervals | Medium | 56.1% | 12.5% | ArraySorting |
| All O`one Data Structure | Hard | 44.1% | 12.5% | Hash TableLinked ListDesign+1 |
| Design Twitter | Medium | 44.2% | 12.5% | Hash TableLinked ListDesign+1 |
| Linked List in Binary Tree | Medium | 51.9% | 12.5% | Linked ListTreeDepth-First Search+1 |
| Stock Price Fluctuation | Medium | 48.9% | 12.5% | Hash TableDesignHeap (Priority Queue)+2 |
| Check If Array Pairs Are Divisible by k | Medium | 46.2% | 12.5% | ArrayHash TableCounting |
| Find the Minimum and Maximum Number of Nodes Between Critical Points | Medium | 69.4% | 12.5% | Linked List |
| Scramble String | Hard | 43.9% | 12.5% | StringDynamic Programming |
| Max Stack | Hard | 45.9% | 12.5% | |
| Make Sum Divisible by P | Medium | 42.6% | 12.5% | ArrayHash TablePrefix Sum |
| Count of Smaller Numbers After Self | Hard | 43.3% | 12.5% | ArrayBinary SearchDivide and Conquer+4 |
| Equal Row and Column Pairs | Medium | 70.8% | 12.5% | ArrayHash TableMatrix+1 |
| Maximum Width Ramp | Medium | 55.8% | 12.5% | ArrayTwo PointersStack+1 |
| Count Almost Equal Pairs I | Medium | 38.2% | 12.5% | ArrayHash TableSorting+2 |
| Divide Intervals Into Minimum Number of Groups | Medium | 63.6% | 12.5% | ArrayTwo PointersGreedy+3 |
| Split a String in Balanced Strings | Easy | 87.3% | 12.5% | StringGreedyCounting |
| Smallest Range Covering Elements from K Lists | Hard | 70.0% | 12.5% | ArrayHash TableGreedy+3 |
| Ones and Zeroes | Medium | 53.0% | 12.5% | ArrayStringDynamic Programming |
| Remove Max Number of Edges to Keep Graph Fully Traversable | Hard | 70.2% | 12.5% | Union-FindGraph Theory |
| Arithmetic Slices | Medium | 64.8% | 12.5% | ArrayDynamic ProgrammingSliding Window |
| Find Kth Bit in Nth Binary String | Medium | 70.2% | 12.5% | StringRecursionSimulation |
| Split a String Into the Max Number of Unique Substrings | Medium | 68.6% | 12.5% | Hash TableStringBacktracking |
| Intersection of Multiple Arrays | Easy | 68.6% | 12.5% | ArrayHash TableSorting+1 |
| Minimum Moves to Equal Array Elements | Medium | 58.5% | 12.5% | ArrayMath |
| Insertion Sort List | Medium | 58.5% | 12.5% | Linked ListSorting |
| Score of Parentheses | Medium | 63.6% | 12.5% | StringStack |
| Reshape the Matrix | Easy | 64.7% | 12.5% | ArrayMatrixSimulation |
| Longest String Chain | Medium | 62.8% | 12.5% | ArrayHash TableTwo Pointers+3 |
| Maximum Vacation Days | Hard | 46.7% | 12.5% | |
| Minimum Consecutive Cards to Pick Up | Medium | 53.5% | 12.5% | ArrayHash TableSliding Window |
| Delete the Middle Node of a Linked List | Medium | 59.5% | 12.5% | Linked ListTwo Pointers |
| Binary Tree Pruning | Medium | 72.4% | 12.5% | TreeDepth-First SearchBinary Tree |
| Longest Square Streak in an Array | Medium | 53.1% | 12.5% | ArrayHash TableBinary Search+2 |
| Sort Array by Increasing Frequency | Easy | 80.7% | 12.5% | ArrayHash TableSorting |
| Insert into a Binary Search Tree | Medium | 73.3% | 12.5% | TreeBinary Search TreeBinary Tree |
| Number of Ways to Form a Target String Given a Dictionary | Hard | 56.6% | 12.5% | ArrayStringDynamic Programming |
| Longest Subsequence With Limited Sum | Easy | 73.4% | 12.5% | ArrayBinary SearchGreedy+2 |
| Tenth Line | Easy | 36.1% | 12.5% | Shell |
| Minimum Number of Changes to Make Binary String Beautiful | Medium | 76.4% | 12.5% | String |
| Find if Array Can Be Sorted | Medium | 66.5% | 12.5% | ArrayBit ManipulationSorting |
| Minimum Number of Removals to Make Mountain Array | Hard | 54.8% | 12.5% | ArrayBinary SearchDynamic Programming+1 |
| Minimum Array End | Medium | 55.4% | 12.5% | Bit Manipulation |
| Add Two Promises | Easy | 91.8% | 12.5% | |
| Shortest Subarray With OR at Least K II | Medium | 50.2% | 12.5% | ArrayBit ManipulationSliding Window |
| Nested List Weight Sum II | Medium | 66.7% | 12.5% | |
| Seat Reservation Manager | Medium | 67.0% | 12.5% | DesignHeap (Priority Queue) |
| Design Hit Counter | Medium | 69.6% | 12.5% | |
| Shortest Subarray to be Removed to Make Array Sorted | Medium | 51.3% | 12.5% | ArrayTwo PointersBinary Search+2 |
| Find the Power of K-Size Subarrays I | Medium | 62.2% | 12.5% | ArraySliding Window |
| Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 23.0% | 12.5% | ArrayTwo PointersBinary Search+5 |
| Number of Operations to Make Network Connected | Medium | 66.1% | 12.5% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Number of Common Factors | Easy | 79.9% | 12.5% | MathEnumerationNumber Theory |
| Defuse the Bomb | Easy | 79.3% | 12.5% | ArraySliding Window |
| Self Dividing Numbers | Easy | 80.5% | 12.5% | Math |
| Sequential Digits | Medium | 65.4% | 12.5% | Enumeration |
| Perfect Number | Easy | 47.9% | 12.5% | Math |
| Percentage of Users Attended a Contest | Easy | 59.9% | 12.5% | Database |
| Take K of Each Character From Left and Right | Medium | 51.5% | 12.5% | Hash TableStringSliding Window |
| Rotating the Box | Medium | 79.2% | 12.5% | ArrayTwo PointersMatrix |
| Sliding Puzzle | Hard | 74.1% | 12.5% | ArrayDynamic ProgrammingBacktracking+3 |
| Find Champion II | Medium | 70.3% | 12.5% | Graph Theory |
| Nth Digit | Medium | 37.1% | 12.5% | MathBinary Search |
| The Maze II | Medium | 55.0% | 12.5% | |
| Add Digits | Easy | 68.6% | 12.5% | MathSimulationNumber Theory |
| Check If N and Its Double Exist | Easy | 41.6% | 12.5% | ArrayHash TableTwo Pointers+2 |
| Move Pieces to Obtain a String | Medium | 56.7% | 12.5% | Two PointersString |
| Valid Phone Numbers | Easy | 28.9% | 12.5% | Shell |
| Minimum Limit of Balls in a Bag | Medium | 66.6% | 12.5% | ArrayBinary Search |
| Special Array II | Medium | 45.8% | 12.5% | ArrayBinary SearchPrefix Sum |
| Nim Game | Easy | 59.2% | 12.5% | MathBrainteaserGame Theory |
| Longest Substring with At Least K Repeating Characters | Medium | 46.0% | 12.5% | Hash TableStringDivide and Conquer+1 |
| Find Longest Special Substring That Occurs Thrice I | Medium | 61.9% | 12.5% | Hash TableStringBinary Search+2 |
| Take Gifts From the Richest Pile | Easy | 75.5% | 12.5% | ArrayHeap (Priority Queue)Simulation |
| Sellers With No Sales | Easy | 54.3% | 12.5% | |
| Linked List Random Node | Medium | 64.6% | 12.5% | Linked ListMathReservoir Sampling+1 |
| Find Score of an Array After Marking All Elements | Medium | 64.5% | 12.5% | ArrayHash TableSorting+2 |
| Number of Laser Beams in a Bank | Medium | 87.0% | 12.5% | ArrayMathString+1 |
| Count Square Submatrices with All Ones | Medium | 80.7% | 12.5% | ArrayDynamic ProgrammingMatrix |
| Design Circular Deque | Medium | 64.4% | 12.5% | ArrayLinked ListDesign+1 |
| Possible Bipartition | Medium | 52.3% | 12.5% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Number Complement | Easy | 70.4% | 12.5% | Bit Manipulation |
| Wiggle Sort II | Medium | 36.9% | 12.5% | ArrayDivide and ConquerGreedy+2 |
| Maximum Earnings From Taxi | Medium | 46.2% | 12.5% | ArrayHash TableBinary Search+2 |
| All Ancestors of a Node in a Directed Acyclic Graph | Medium | 62.1% | 12.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| My Calendar I | Medium | 58.2% | 12.5% | ArrayBinary SearchDesign+2 |
| Determine Whether Matrix Can Be Obtained By Rotation | Easy | 59.2% | 12.5% | ArrayMatrix |
| Make The String Great | Easy | 68.4% | 12.5% | StringStack |
| Car Fleet | Medium | 54.7% | 12.5% | ArrayStackSorting+1 |
| Divisor Game | Easy | 71.5% | 12.5% | MathDynamic ProgrammingBrainteaser+1 |
| Smallest Missing Integer Greater Than Sequential Prefix Sum | Easy | 35.1% | 12.5% | ArrayHash TableSorting |
| Sign of the Product of an Array | Easy | 64.8% | 12.5% | ArrayMath |
| Number of Islands II | Hard | 40.4% | 12.5% | |
| Best Sightseeing Pair | Medium | 62.7% | 12.5% | ArrayDynamic Programming |
| Count Ways To Build Good Strings | Medium | 59.0% | 12.5% | Dynamic Programming |
| Block Placement Queries | Hard | 18.4% | 12.5% | ArrayBinary SearchBinary Indexed Tree+1 |
| Stone Game III | Hard | 63.3% | 12.5% | ArrayMathDynamic Programming+1 |
| Maximum Frequency Stack | Hard | 66.6% | 12.5% | Hash TableStackDesign+1 |
| Not Boring Movies | Easy | 75.1% | 12.5% | Database |
| Construct String With Repeat Limit | Medium | 70.9% | 12.5% | Hash TableStringGreedy+2 |
| Number of Ways to Split Array | Medium | 55.9% | 12.5% | ArrayPrefix Sum |
| Minimum Number of Operations to Move All Balls to Each Box | Medium | 90.1% | 12.5% | ArrayStringPrefix Sum |
| String Matching in an Array | Easy | 69.7% | 12.5% | ArrayStringString Matching |
| Heaters | Medium | 41.4% | 12.5% | ArrayTwo PointersBinary Search+1 |
| Count Prefix and Suffix Pairs I | Easy | 77.8% | 12.5% | ArrayStringTrie+3 |
| Sort Vowels in a String | Medium | 83.4% | 12.5% | StringSorting |
| Exchange Seats | Medium | 73.8% | 12.5% | Database |
| Counting Words With a Given Prefix | Easy | 84.5% | 12.5% | ArrayStringString Matching |
| Word Subsets | Medium | 55.9% | 12.5% | ArrayHash TableString |
| Construct K Palindrome Strings | Medium | 68.6% | 12.5% | Hash TableStringGreedy+1 |
| Check if a Parentheses String Can Be Valid | Medium | 45.1% | 12.5% | StringStackGreedy |
| Mini Parser | Medium | 42.0% | 12.5% | StringStackDepth-First Search |
| Longest Repeating Substring | Medium | 63.4% | 12.5% | |
| Number of Zero-Filled Subarrays | Medium | 70.1% | 12.5% | ArrayMath |
| 2 Keys Keyboard | Medium | 59.3% | 12.5% | MathDynamic Programming |
| Detect Squares | Medium | 52.3% | 12.5% | ArrayHash TableDesign+2 |
| Find the Difference of Two Arrays | Easy | 81.3% | 12.5% | ArrayHash Table |
| Spiral Matrix IV | Medium | 82.3% | 12.5% | ArrayLinked ListMatrix+1 |
| Movement of Robots | Medium | 27.8% | 12.5% | ArrayBrainteaserSorting+1 |
| Minimum Cost to Make at Least One Valid Path in a Grid | Hard | 70.9% | 12.5% | ArrayBreadth-First SearchGraph Theory+3 |
| Bitwise XOR of All Pairings | Medium | 66.9% | 12.5% | ArrayBit ManipulationBrainteaser |
| Maximum and Minimum Sums of at Most Size K Subsequences | Medium | 21.6% | 12.5% | ArrayMathDynamic Programming+2 |
| Investments in 2016 | Medium | 50.8% | 12.5% | Database |
| Print Binary Tree | Medium | 66.4% | 12.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Count Servers that Communicate | Medium | 73.5% | 12.5% | ArrayDepth-First SearchBreadth-First Search+3 |
| Long Pressed Name | Easy | 32.8% | 12.5% | Two PointersString |
| Maximum Twin Sum of a Linked List | Medium | 81.6% | 12.5% | Linked ListTwo PointersStack |
| Valid Mountain Array | Easy | 35.0% | 12.5% | Array |
| Count Number of Maximum Bitwise-OR Subsets | Medium | 89.6% | 12.5% | ArrayBacktrackingBit Manipulation+1 |
| Course Schedule IV | Medium | 59.7% | 12.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Minimum Area Rectangle | Medium | 55.3% | 12.5% | ArrayHash TableMath+2 |
| Maximum Number of Fish in a Grid | Medium | 70.5% | 12.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Maximum Gap | Medium | 51.4% | 12.5% | ArraySortingBucket Sort+1 |
| Apply Operations to Make All Array Elements Equal to Zero | Medium | 33.2% | 12.5% | ArrayPrefix Sum |
| Divide Nodes Into the Maximum Number of Groups | Hard | 67.0% | 12.5% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Special Array I | Easy | 81.6% | 12.5% | Array |
| Find Smallest Letter Greater Than Target | Easy | 58.9% | 12.5% | ArrayBinary Search |
| Longest Strictly Increasing or Strictly Decreasing Subarray | Easy | 64.9% | 12.5% | Array |
| Tuple with Same Product | Medium | 70.1% | 12.5% | ArrayHash TableCounting |
| Similar String Groups | Hard | 56.1% | 12.5% | ArrayHash TableString+3 |
| Minimum Absolute Difference | Easy | 75.0% | 12.5% | ArraySorting |
| How Many Numbers Are Smaller Than the Current Number | Easy | 87.5% | 12.5% | ArrayHash TableSorting+1 |
| Meeting Rooms III | Hard | 51.7% | 12.5% | ArrayHash TableSorting+2 |
| Clear Digits | Easy | 82.7% | 12.5% | StringStackSimulation |
| Remove All Occurrences of a Substring | Medium | 78.4% | 12.5% | StringStackSimulation |
| Max Sum of a Pair With Equal Sum of Digits | Medium | 66.0% | 12.5% | ArrayHash TableSorting+1 |
| Minimum Distance Between BST Nodes | Easy | 61.1% | 12.5% | TreeDepth-First SearchBreadth-First Search+2 |
| Snakes and Ladders | Medium | 48.0% | 12.5% | ArrayBreadth-First SearchMatrix |
| Minimum Operations to Exceed Threshold Value II | Medium | 45.8% | 12.5% | ArrayHeap (Priority Queue)Simulation |
| Find the Punishment Number of an Integer | Medium | 81.7% | 12.5% | MathBacktracking |
| Palindrome Partitioning II | Hard | 36.6% | 12.5% | StringDynamic Programming |
| Rank Transform of a Matrix | Hard | 42.0% | 12.5% | ArrayUnion-FindGraph Theory+3 |
| Letter Tile Possibilities | Medium | 83.5% | 12.5% | Hash TableStringBacktracking+1 |
| Construct Smallest Number From DI String | Medium | 85.6% | 12.5% | StringBacktrackingStack+1 |
| Delete and Earn | Medium | 57.1% | 12.5% | ArrayHash TableDynamic Programming |
| Max Chunks To Make Sorted | Medium | 64.1% | 12.5% | ArrayStackGreedy+2 |
| Unique Word Abbreviation | Medium | 27.4% | 12.5% | |
| The k-th Lexicographical String of All Happy Strings of Length n | Medium | 85.3% | 12.5% | StringBacktracking |
| Find the Highest Altitude | Easy | 83.9% | 12.5% | ArrayPrefix Sum |
| Arithmetic Slices II - Subsequence | Hard | 54.9% | 12.5% | ArrayDynamic Programming |
| Construct Binary Tree from Preorder and Postorder Traversal | Medium | 78.1% | 12.5% | ArrayHash TableDivide and Conquer+2 |
| Max Consecutive Ones II | Medium | 51.9% | 12.5% | |
| Most Profitable Path in a Tree | Medium | 67.3% | 12.5% | ArrayTreeDepth-First Search+2 |
| Number of Sub-arrays With Odd Sum | Medium | 55.8% | 12.5% | ArrayMathDynamic Programming+1 |
| Successful Pairs of Spells and Potions | Medium | 49.4% | 12.5% | ArrayTwo PointersBinary Search+1 |
| Second Minimum Node In a Binary Tree | Easy | 45.9% | 12.5% | TreeDepth-First SearchBinary Tree |
| Length of Longest Fibonacci Subsequence | Medium | 57.5% | 12.5% | ArrayHash TableDynamic Programming |
| Number of Submatrices That Sum to Target | Hard | 74.6% | 12.5% | ArrayHash TableMatrix+1 |
| Number of Students Unable to Eat Lunch | Easy | 79.3% | 12.5% | ArrayStackQueue+1 |
| Merge Two 2D Arrays by Summing Values | Easy | 81.8% | 12.5% | ArrayHash TableTwo Pointers |
| Find the Town Judge | Easy | 50.5% | 12.5% | ArrayHash TableGraph Theory |
| Longest Duplicate Substring | Hard | 31.1% | 12.5% | StringBinary SearchSliding Window+3 |
| Apply Operations to an Array | Easy | 74.7% | 12.5% | ArrayTwo PointersSimulation |
| Check if Number is a Sum of Powers of Three | Medium | 79.4% | 12.5% | Math |
| Count Total Number of Colored Cells | Medium | 66.1% | 12.5% | Math |
| Most Stones Removed with Same Row or Column | Medium | 62.7% | 12.5% | Hash TableDepth-First SearchUnion-Find+1 |
| Magnetic Force Between Two Balls | Medium | 71.9% | 12.5% | ArrayBinary SearchSorting |
| Delete Nodes From Linked List Present in Array | Medium | 69.5% | 12.5% | ArrayHash TableLinked List |
| Closest Prime Numbers in Range | Medium | 51.7% | 12.5% | MathNumber Theory |
| Water Bottles | Easy | 72.6% | 12.5% | MathSimulation |
| Find the Shortest Superstring | Hard | 45.1% | 12.5% | ArrayStringDynamic Programming+2 |
| Function Composition | Easy | 86.9% | 12.5% | |
| Restaurant Growth | Medium | 58.2% | 12.5% | Database |
| Longest Harmonious Subsequence | Easy | 64.4% | 12.5% | ArrayHash TableSliding Window+2 |
| Arranging Coins | Easy | 48.0% | 12.5% | MathBinary Search |
| Zero Array Transformation II | Medium | 43.6% | 12.5% | ArrayBinary SearchPrefix Sum |
| Minimum Recolors to Get K Consecutive Black Blocks | Easy | 68.6% | 12.5% | StringSliding Window |
| Design Parking System | Easy | 87.1% | 12.5% | DesignSimulationCounting |
| House Robber IV | Medium | 64.8% | 12.5% | ArrayBinary SearchDynamic Programming+1 |
| Image Smoother | Easy | 69.1% | 12.5% | ArrayMatrix |
| Walking Robot Simulation | Medium | 58.4% | 12.5% | ArrayHash TableSimulation |
| Display the First Three Rows | Easy | 93.1% | 12.5% | |
| Beautiful Array | Medium | 68.6% | 12.5% | ArrayMathDivide and Conquer |
| Longest Nice Subarray | Medium | 64.8% | 12.5% | ArrayBit ManipulationSliding Window |
| X of a Kind in a Deck of Cards | Easy | 30.1% | 12.5% | ArrayHash TableMath+2 |
| Construct String from Binary Tree | Medium | 70.6% | 12.5% | StringTreeDepth-First Search+1 |
| Validate Stack Sequences | Medium | 70.2% | 12.5% | ArrayStackSimulation |
| Minimum Cost Walk in Weighted Graph | Hard | 68.3% | 12.5% | ArrayBit ManipulationUnion-Find+1 |
| Find All Possible Recipes from Given Supplies | Medium | 56.8% | 12.5% | ArrayHash TableString+2 |
| Shortest Path Visiting All Nodes | Hard | 65.7% | 12.5% | Dynamic ProgrammingBit ManipulationBreadth-First Search+2 |
| Final Array State After K Multiplication Operations II | Hard | 13.0% | 12.5% | ArrayHeap (Priority Queue)Simulation |
| Two Furthest Houses With Different Colors | Easy | 65.5% | 12.5% | ArrayGreedy |
| Group Sold Products By The Date | Easy | 77.9% | 12.5% | Database |
| Convert BST to Greater Tree | Medium | 71.4% | 12.5% | TreeDepth-First SearchBinary Search Tree+1 |
| Flatten Deeply Nested Array | Medium | 65.5% | 12.5% | |
| Detect Capital | Easy | 56.5% | 12.5% | String |
| Find Building Where Alice and Bob Can Meet | Hard | 52.2% | 12.5% | ArrayBinary SearchStack+4 |
| Minimum Operations to Make a Uni-Value Grid | Medium | 67.5% | 12.5% | ArrayMathSorting+1 |
| Generate Random Point in a Circle | Medium | 42.4% | 12.5% | MathGeometryRejection Sampling+1 |
| Maximum Number of Points From Grid Queries | Hard | 59.3% | 12.5% | ArrayTwo PointersBreadth-First Search+4 |
| Apply Operations to Maximize Score | Hard | 53.7% | 12.5% | ArrayMathStack+4 |
| Put Marbles in Bags | Hard | 72.2% | 12.5% | ArrayGreedySorting+1 |
| Transpose File | Medium | 30.6% | 12.5% | Shell |
| Maximum Absolute Sum of Any Subarray | Medium | 71.2% | 12.5% | ArrayDynamic Programming |
| Solving Questions With Brainpower | Medium | 60.2% | 12.5% | ArrayDynamic Programming |
| Maximum Value of an Ordered Triplet I | Easy | 58.2% | 12.5% | Array |
| Remove Boxes | Hard | 49.3% | 12.5% | ArrayDynamic ProgrammingMemoization |
| Minimum Deletions to Make String Balanced | Medium | 68.2% | 12.5% | StringDynamic ProgrammingStack |
| Divide Array Into Equal Pairs | Easy | 79.2% | 12.5% | ArrayHash TableBit Manipulation+1 |
| Minimum Number of Operations to Make Elements in Array Distinct | Easy | 71.3% | 12.5% | ArrayHash Table |
| Maximum Odd Binary Number | Easy | 82.9% | 12.5% | MathStringGreedy |
| K-diff Pairs in an Array | Medium | 45.6% | 12.5% | ArrayHash TableTwo Pointers+2 |
| Logger Rate Limiter | Easy | 76.8% | 12.5% | |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 12.5% | ArrayBinary SearchDynamic Programming+1 |
| Minimum Average Difference | Medium | 43.8% | 12.5% | ArrayPrefix Sum |
| Strange Printer | Hard | 60.9% | 12.5% | StringDynamic Programming |
| Find the Count of Good Integers | Hard | 69.5% | 12.5% | Hash TableMathCombinatorics+1 |
| Shuffle the Array | Easy | 89.0% | 12.5% | Array |
| Path with Maximum Gold | Medium | 68.3% | 12.5% | ArrayBacktrackingMatrix |
| Longest Palindrome After Substring Concatenation I | Medium | 43.8% | 12.5% | Two PointersStringDynamic Programming+1 |
| Count Special Quadruplets | Easy | 64.4% | 12.5% | ArrayHash TableEnumeration |
| Number of Valid Words in a Sentence | Easy | 31.0% | 12.5% | String |
| HTML Entity Parser | Medium | 50.3% | 12.5% | Hash TableString |
| Rank Scores | Medium | 67.1% | 12.5% | Database |
| Meeting Scheduler | Medium | 55.2% | 12.5% | |
| Count Symmetric Integers | Easy | 83.1% | 12.5% | MathEnumeration |
| Count Square Sum Triples | Easy | 77.1% | 12.5% | MathEnumeration |
| Count the Number of Good Subarrays | Medium | 65.9% | 12.5% | ArrayHash TableSliding Window |
| Count Equal and Divisible Pairs in an Array | Easy | 84.0% | 12.5% | Array |
| Matchsticks to Square | Medium | 41.6% | 12.5% | ArrayDynamic ProgrammingBacktracking+2 |
| Find Maximal Uncovered Ranges | Medium | 49.3% | 12.5% | |
| Count the Number of Fair Pairs | Medium | 52.7% | 12.5% | ArrayTwo PointersBinary Search+1 |
| Rabbits in Forest | Medium | 58.0% | 12.5% | ArrayHash TableMath+1 |
| Count Nice Pairs in an Array | Medium | 48.4% | 12.5% | ArrayHash TableMath+1 |
| Count the Hidden Sequences | Medium | 56.7% | 12.5% | ArrayPrefix Sum |
| Knight Dialer | Medium | 61.7% | 12.5% | Dynamic Programming |
| String Compression III | Medium | 67.0% | 12.5% | String |
| Count of Range Sum | Hard | 38.3% | 12.5% | ArrayBinary SearchDivide and Conquer+4 |
| Word Frequency | Medium | 28.4% | 12.5% | Shell |
| Count Complete Subarrays in an Array | Medium | 75.9% | 12.5% | ArrayHash TableSliding Window |
| Minimum Operations to Reduce X to Zero | Medium | 40.4% | 12.5% | ArrayHash TableBinary Search+2 |
| Count of Interesting Subarrays | Medium | 58.0% | 12.5% | ArrayHash TablePrefix Sum |
| Race Car | Hard | 44.6% | 12.5% | Dynamic Programming |
| Minimum Cost to Cut a Stick | Hard | 62.8% | 12.5% | ArrayDynamic ProgrammingSorting |
| Nth Magical Number | Hard | 36.4% | 12.5% | MathBinary Search |
| Reverse Nodes in Even Length Groups | Medium | 63.6% | 12.5% | Linked List |
| Count Subarrays of Length Three With a Condition | Easy | 61.5% | 12.5% | Array |
| A Number After a Double Reversal | Easy | 82.0% | 12.5% | Math |
| Satisfiability of Equality Equations | Medium | 51.5% | 12.5% | ArrayStringUnion-Find+1 |
| Find Words Containing Character | Easy | 90.4% | 12.5% | ArrayString |
| Find Followers Count | Easy | 69.5% | 12.5% | Database |
| Fizz Buzz Multithreaded | Medium | 74.6% | 12.5% | Concurrency |
| Keys and Rooms | Medium | 75.5% | 12.5% | Depth-First SearchBreadth-First SearchGraph Theory |
| Find the Closest Palindrome | Hard | 31.8% | 12.5% | MathString |
| Calculate Money in Leetcode Bank | Easy | 82.3% | 12.5% | Math |
| Maximum Number of Tasks You Can Assign | Hard | 50.2% | 12.5% | ArrayTwo PointersBinary Search+4 |
| Minimum Operations to Make Binary Array Elements Equal to One I | Medium | 80.4% | 12.5% | ArrayBit ManipulationQueue+2 |
| Push Dominoes | Medium | 63.0% | 12.5% | Two PointersStringDynamic Programming |
| Concatenated Divisibility | Hard | 30.6% | 12.5% | ArrayDynamic ProgrammingBit Manipulation+1 |
| Maximum Performance of a Team | Hard | 47.7% | 12.5% | ArrayGreedySorting+1 |
| Painting the Walls | Hard | 48.9% | 12.5% | ArrayDynamic Programming |
| Domino and Tromino Tiling | Medium | 51.4% | 12.5% | Dynamic Programming |
| Minimum Moves to Reach Target Score | Medium | 52.0% | 12.5% | MathGreedy |
| Minimum Number of Taps to Open to Water a Garden | Hard | 51.0% | 12.5% | ArrayDynamic ProgrammingGreedy |
| Remove Digit From Number to Maximize Result | Easy | 48.2% | 12.5% | StringGreedyEnumeration |
| Count Number of Balanced Permutations | Hard | 49.1% | 12.5% | MathStringDynamic Programming+1 |
| Three Consecutive Odds | Easy | 69.3% | 12.5% | Array |
| Finding 3-Digit Even Numbers | Easy | 78.8% | 12.5% | ArrayHash TableRecursion+2 |
| Longest Uncommon Subsequence I | Easy | 62.0% | 12.5% | String |
| Find Minimum Time to Finish All Jobs | Hard | 45.3% | 12.5% | ArrayDynamic ProgrammingBacktracking+2 |
| Total Characters in String After Transformations II | Hard | 58.1% | 12.5% | Hash TableMathString+2 |
| Minimum Domino Rotations For Equal Row | Medium | 56.5% | 12.5% | ArrayGreedy |
| Longest Unequal Adjacent Groups Subsequence II | Medium | 51.4% | 12.5% | ArrayStringDynamic Programming |
| Find Minimum Time to Reach Last Room I | Medium | 55.5% | 12.5% | ArrayGraph TheoryHeap (Priority Queue)+2 |
| Painting a Grid With Three Different Colors | Hard | 77.3% | 12.5% | Dynamic Programming |
| Zero Array Transformation III | Medium | 54.9% | 12.5% | ArrayGreedySorting+2 |
| Minimum Cost of Buying Candies With Discount | Easy | 62.7% | 12.5% | ArrayGreedySorting |
| Find the Maximum Sum of Node Values | Hard | 69.5% | 12.5% | ArrayDynamic ProgrammingGreedy+3 |
| Maximum Units on a Truck | Easy | 74.6% | 12.5% | ArrayGreedySorting |
| Longest Palindrome by Concatenating Two Letter Words | Medium | 53.5% | 12.5% | ArrayHash TableString+2 |
| Largest Color Value in a Directed Graph | Hard | 57.4% | 12.5% | Hash TableStringDynamic Programming+4 |
| Binary Watch | Easy | 65.1% | 12.5% | BacktrackingBit Manipulation |
| Beautiful Towers I | Medium | 44.3% | 12.5% | ArrayStackMonotonic Stack |
| Divisible and Non-divisible Sums Difference | Easy | 91.0% | 12.5% | Math |
| Minimum Adjacent Swaps to Reach the Kth Smallest Number | Medium | 72.1% | 12.5% | Two PointersStringGreedy |
| Recover Binary Search Tree | Medium | 58.7% | 12.5% | TreeDepth-First SearchBinary Search Tree+1 |
| Total Distance Traveled | Easy | 41.2% | 12.5% | MathSimulation |
| Find Center of Star Graph | Easy | 86.6% | 12.5% | Graph Theory |
| Clone Binary Tree With Random Pointer | Medium | 80.9% | 12.5% | |
| Last Person to Fit in the Bus | Medium | 68.9% | 12.5% | Database |
| Network Delay Time | Medium | 59.7% | 12.5% | Depth-First SearchBreadth-First SearchGraph Theory+2 |
| Distribute Candies Among Children II | Medium | 55.7% | 12.5% | MathCombinatoricsEnumeration |
| Timeout Cancellation | Easy | 89.7% | 12.5% | |
| Find the Lexicographically Largest String From the Box I | Medium | 41.0% | 12.5% | Two PointersStringEnumeration |
| Third Maximum Number | Easy | 38.8% | 12.5% | ArraySorting |
| Lexicographically Smallest Equivalent String | Medium | 81.1% | 12.5% | StringUnion-Find |
| Design File System | Medium | 65.1% | 12.5% | |
| Kth Smallest Number in Multiplication Table | Hard | 53.8% | 12.5% | MathBinary Search |
| Sleep | Easy | 87.4% | 12.5% | |
| Using a Robot to Print the Lexicographically Smallest String | Medium | 62.5% | 12.5% | Hash TableStringStack+1 |
| Number of Matching Subsequences | Medium | 50.6% | 12.5% | ArrayHash TableString+4 |
| Lexicographically Minimum String After Removing Stars | Medium | 51.0% | 12.5% | Hash TableStringStack+2 |
| Bitwise AND of Numbers Range | Medium | 48.6% | 12.5% | Bit Manipulation |
| Maximum Difference Between Even and Odd Frequency I | Easy | 60.7% | 12.5% | Hash TableStringCounting |
| Maximum Difference Between Even and Odd Frequency II | Hard | 48.7% | 12.5% | StringSliding WindowEnumeration+1 |
| Product Sales Analysis I | Easy | 85.6% | 12.5% | Database |
| Maximum Difference Between Adjacent Elements in a Circular Array | Easy | 75.7% | 12.5% | Array |
| To Lower Case | Easy | 84.7% | 12.5% | String |
| Group the People Given the Group Size They Belong To | Medium | 87.5% | 12.5% | ArrayHash TableGreedy |
| Maximum Difference by Remapping a Digit | Easy | 76.1% | 12.5% | MathGreedy |
| Minimize the Maximum Difference of Pairs | Medium | 50.9% | 12.5% | ArrayBinary SearchDynamic Programming+2 |
| Flip String to Monotone Increasing | Medium | 61.8% | 12.5% | StringDynamic Programming |
| Transform Array to All Equal Elements | Medium | 33.0% | 12.5% | ArrayGreedy |
| Max Difference You Can Get From Changing an Integer | Medium | 48.8% | 12.5% | MathGreedy |
| Minimum Time to Complete Trips | Medium | 39.6% | 12.5% | ArrayBinary Search |
| Maximum Difference Between Increasing Elements | Easy | 66.4% | 12.5% | Array |
| Count the Number of Arrays with K Matching Adjacent Elements | Hard | 58.4% | 12.5% | MathCombinatorics |
| Maximum Product of Two Elements in an Array | Easy | 83.5% | 12.5% | ArraySortingHeap (Priority Queue) |
| Divide Array Into Arrays With Max Difference | Medium | 79.0% | 12.5% | ArrayGreedySorting |
| Maximum Manhattan Distance After K Changes | Medium | 54.2% | 12.5% | Hash TableMathString+1 |
| Minimum Number of Vertices to Reach All Nodes | Medium | 81.5% | 12.5% | Graph Theory |
| Rotated Digits | Medium | 56.8% | 12.5% | MathDynamic Programming |
| Smallest Number in Infinite Set | Medium | 70.6% | 12.5% | Hash TableDesignHeap (Priority Queue)+1 |
| Find the Peaks | Easy | 75.0% | 12.5% | ArrayEnumeration |
| Minimum Fuel Cost to Report to the Capital | Medium | 64.7% | 12.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Sum of k-Mirror Numbers | Hard | 63.7% | 12.5% | MathEnumeration |
| Reach End of Array With Max Score | Medium | 33.4% | 12.5% | ArrayGreedy |
| Find All K-Distant Indices in an Array | Easy | 77.4% | 12.5% | ArrayTwo Pointers |
| Find Duplicate Subtrees | Medium | 60.6% | 12.5% | Hash TableTreeDepth-First Search+1 |
| Find Original Array From Doubled Array | Medium | 40.7% | 12.5% | ArrayHash TableGreedy+1 |
| Collect Coins in a Tree | Hard | 39.6% | 12.5% | ArrayTreeGraph Theory+1 |
| Furthest Building You Can Reach | Medium | 50.7% | 12.5% | ArrayGreedyHeap (Priority Queue) |
| Continuous Subarrays | Medium | 57.9% | 12.5% | ArrayQueueSliding Window+3 |
| Find Subsequence of Length K With the Largest Sum | Easy | 57.4% | 12.5% | ArrayHash TableSorting+1 |
| Repeated String Match | Medium | 38.3% | 12.5% | StringString Matching |
| Interleaving String | Medium | 43.5% | 12.5% | StringDynamic Programming |
| Find the Original Typed String I | Easy | 72.1% | 12.5% | String |
| Find the Original Typed String II | Hard | 45.6% | 12.5% | StringDynamic ProgrammingPrefix Sum |
| Detect Cycles in 2D Grid | Medium | 52.4% | 12.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Fraction Addition and Subtraction | Medium | 66.4% | 12.5% | MathStringSimulation |
| Ways to Express an Integer as Sum of Powers | Medium | 49.9% | 12.5% | Dynamic Programming |
| Sales Person | Easy | 65.8% | 12.5% | Database |
| Find Lucky Integer in an Array | Easy | 75.5% | 12.5% | ArrayHash TableCounting |
| Prime Palindrome | Medium | 27.9% | 12.5% | MathNumber Theory |
| Find Root of N-Ary Tree | Medium | 78.6% | 12.5% | |
| Paint Fence | Medium | 48.3% | 12.5% | |
| Maximum XOR of Two Numbers in an Array | Medium | 53.4% | 12.5% | ArrayHash TableBit Manipulation+1 |
| Count Odd Numbers in an Interval Range | Easy | 54.4% | 12.5% | Math |
| Reschedule Meetings for Maximum Free Time I | Medium | 53.9% | 12.5% | ArrayGreedySliding Window |
| Sum of Absolute Differences in a Sorted Array | Medium | 68.2% | 12.5% | ArrayMathPrefix Sum |
| The Earliest and Latest Rounds Where Players Compete | Hard | 72.7% | 12.5% | Dynamic ProgrammingMemoization |
| Maximum Matching of Players With Trainers | Medium | 75.2% | 12.5% | ArrayTwo PointersGreedy+1 |
| Construct Binary Tree from Inorder and Postorder Traversal | Medium | 68.0% | 12.5% | ArrayHash TableDivide and Conquer+2 |
| Height of Binary Tree After Subtree Removal Queries | Hard | 54.9% | 12.5% | ArrayTreeDepth-First Search+2 |
| Valid Word | Easy | 50.9% | 12.5% | String |
| Smallest Range II | Medium | 37.7% | 12.5% | ArrayMathGreedy+1 |
| Find the Maximum Length of Valid Subsequence I | Medium | 54.9% | 12.5% | ArrayDynamic Programming |
| Sum of Root To Leaf Binary Numbers | Easy | 73.7% | 12.5% | TreeDepth-First SearchBinary Tree |
| Minimum Difference in Sums After Removal of Elements | Hard | 69.9% | 12.5% | ArrayDynamic ProgrammingHeap (Priority Queue) |
| Repeated Substring Pattern | Easy | 47.8% | 12.5% | StringString Matching |
| Find N Unique Integers Sum up to Zero | Easy | 78.5% | 12.5% | ArrayMath |
| Sort Items by Groups Respecting Dependencies | Hard | 65.6% | 12.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Minimum Number Game | Easy | 85.3% | 12.5% | ArraySortingHeap (Priority Queue)+1 |
| Super Pow | Medium | 36.3% | 12.5% | MathDivide and Conquer |
| Delete Characters to Make Fancy String | Easy | 74.1% | 12.5% | String |
| Maximum Erasure Value | Medium | 64.1% | 12.5% | ArrayHash TableSliding Window |
| Richest Customer Wealth | Easy | 88.7% | 12.5% | ArrayMatrix |
| Single-Threaded CPU | Medium | 47.3% | 12.5% | ArraySortingHeap (Priority Queue) |
| Minimum Score After Removals on a Tree | Hard | 76.2% | 12.5% | ArrayBit ManipulationTree+1 |
| Maximum Unique Subarray Sum After Deletion | Easy | 40.5% | 12.5% | ArrayHash TableGreedy |
| Count Number of Trapezoids II | Hard | 40.0% | 12.5% | ArrayHash TableMath+1 |
| Shifting Letters | Medium | 46.1% | 12.5% | ArrayStringPrefix Sum |
| Maximum Score From Removing Substrings | Medium | 66.6% | 12.5% | StringStackGreedy |
| Resulting String After Adjacent Removals | Medium | 56.6% | 12.5% | StringStackSimulation |
| Complement of Base 10 Integer | Easy | 60.6% | 12.5% | Bit Manipulation |
| Shortest Cycle in a Graph | Hard | 39.1% | 12.5% | Breadth-First SearchGraph Theory |
| Palindrome Pairs | Hard | 36.9% | 12.5% | ArrayHash TableString+1 |
| Smallest Subarrays With Maximum Bitwise OR | Medium | 62.0% | 12.5% | ArrayBinary SearchBit Manipulation+1 |
| Minimum Addition to Make Integer Beautiful | Medium | 38.5% | 12.5% | MathGreedy |
| Bitwise ORs of Subarrays | Medium | 56.8% | 12.5% | ArrayDynamic ProgrammingBit Manipulation |
| Minimum Number of Operations to Make Array Empty | Medium | 62.1% | 12.5% | ArrayHash TableGreedy+1 |
| Rearranging Fruits | Hard | 57.5% | 12.5% | ArrayHash TableGreedy+1 |
| Reach a Number | Medium | 44.6% | 12.5% | MathBinary Search |
| Complex Number Multiplication | Medium | 73.2% | 12.5% | MathStringSimulation |
| Reordered Power of 2 | Medium | 66.0% | 12.5% | Hash TableMathSorting+2 |
| Partition Array into Two Equal Product Subsets | Medium | 35.1% | 12.5% | ArrayBit ManipulationRecursion+1 |
| Maximum 69 Number | Easy | 84.5% | 12.5% | MathGreedy |
| Swap Sex of Employees | Easy | 84.5% | 12.5% | Database |
| Design Linked List | Medium | 29.8% | 12.5% | Linked ListDesign |
| New 21 Game | Medium | 52.0% | 12.5% | MathDynamic ProgrammingSliding Window+1 |
| Game Play Analysis I | Easy | 76.2% | 12.5% | Database |
| Transformed Array | Easy | 70.4% | 12.5% | ArraySimulation |
| Check If a String Contains All Binary Codes of Size K | Medium | 56.9% | 12.5% | Hash TableStringBit Manipulation+2 |
| Longest Arithmetic Subsequence of Given Difference | Medium | 54.3% | 12.5% | ArrayHash TableDynamic Programming |
| Maximum Alternating Subsequence Sum | Medium | 59.0% | 12.5% | ArrayDynamic Programming |
| Maximum Number of Occurrences of a Substring | Medium | 54.2% | 12.5% | Hash TableStringSliding Window |
| Count Submatrices With All Ones | Medium | 71.1% | 12.5% | ArrayDynamic ProgrammingStack+2 |
| Max Pair Sum in an Array | Easy | 60.4% | 12.5% | ArrayHash Table |
| 24 Game | Hard | 59.3% | 12.5% | ArrayMathBacktracking |
| Count the Number of Powerful Integers | Hard | 46.3% | 12.5% | MathStringDynamic Programming |
| Check if Two Chessboard Squares Have the Same Color | Easy | 72.2% | 12.5% | MathString |
| Longest Arithmetic Subsequence | Medium | 49.9% | 12.5% | ArrayHash TableBinary Search+1 |
| Non-decreasing Array | Medium | 25.4% | 12.5% | Array |
| Maximum Area of Longest Diagonal Rectangle | Easy | 45.9% | 12.5% | Array |
| Distribute Candies | Easy | 70.7% | 12.5% | ArrayHash Table |
| Minimum Time to Repair Cars | Medium | 59.6% | 12.5% | ArrayBinary Search |
| Reformat Department Table | Easy | 76.3% | 12.5% | Database |
| Sort Matrix by Diagonals | Medium | 84.7% | 12.5% | ArraySortingMatrix |
| Reorder Data in Log Files | Medium | 56.9% | 12.5% | ArrayStringSorting |
| Maximum Average Pass Ratio | Medium | 74.1% | 12.5% | ArrayGreedyHeap (Priority Queue) |
| Find the Number of Ways to Place People I | Medium | 64.0% | 12.5% | ArrayMathGeometry+2 |
| Reorder Routes to Make All Paths Lead to the City Zero | Medium | 65.6% | 12.5% | Depth-First SearchBreadth-First SearchGraph Theory |
| Find the Number of Ways to Place People II | Hard | 64.4% | 12.5% | ArrayMathGeometry+2 |
| Find Closest Person | Easy | 88.9% | 12.5% | Math |
| Minimum Operations to Make the Integer Zero | Medium | 58.2% | 12.5% | Bit ManipulationBrainteaserEnumeration |
| 3Sum With Multiplicity | Medium | 46.2% | 12.5% | ArrayHash TableTwo Pointers+2 |
| Special Positions in a Binary Matrix | Easy | 68.8% | 12.5% | ArrayMatrix |
| Cherry Pickup | Hard | 39.1% | 12.5% | ArrayDynamic ProgrammingMatrix |
| Binary Tree Longest Consecutive Sequence | Medium | 54.6% | 12.5% | |
| Find Most Frequent Vowel and Consonant | Easy | 89.4% | 12.5% | Hash TableStringCounting |
| Vowels Game in a String | Medium | 77.1% | 12.5% | MathStringBrainteaser+1 |
| Vowel Spellchecker | Medium | 61.4% | 12.5% | ArrayHash TableString |
| Jump Game IV | Hard | 46.2% | 12.5% | ArrayHash TableBreadth-First Search |
| Replace Elements with Greatest Element on Right Side | Easy | 72.0% | 12.5% | Array |
| Distant Barcodes | Medium | 48.6% | 12.5% | ArrayHash TableGreedy+3 |
| Find the XOR of Numbers Which Appear Twice | Easy | 78.7% | 12.5% | ArrayHash TableBit Manipulation |
| Grid Teleportation Traversal | Medium | 23.2% | 12.5% | ArrayHash TableBreadth-First Search+1 |
| Additive Number | Medium | 33.5% | 12.5% | StringBacktracking |
| Valid Triangle Number | Medium | 56.7% | 12.5% | ArrayTwo PointersBinary Search+2 |
| Largest Perimeter Triangle | Easy | 62.0% | 12.5% | ArrayMathGreedy+1 |
| Minimum Score Triangulation of Polygon | Medium | 67.4% | 12.5% | ArrayDynamic Programming |
| Decode the Message | Easy | 85.8% | 12.5% | Hash TableString |
| Sentence Similarity III | Medium | 48.5% | 12.5% | ArrayTwo PointersString |
| Strong Password Checker | Hard | 15.4% | 12.5% | StringGreedyHeap (Priority Queue) |
| Perfect Rectangle | Hard | 37.2% | 12.5% | ArrayHash TableMath+2 |
| Water Bottles II | Medium | 78.1% | 12.5% | MathSimulation |
| Loud and Rich | Medium | 63.2% | 12.5% | ArrayDepth-First SearchGraph Theory+1 |
| Zigzag Grid Traversal With Skip | Easy | 64.8% | 12.5% | ArrayMatrixSimulation |
| Best Time to Buy and Sell Stock using Strategy | Medium | 59.9% | 12.5% | ArraySliding WindowPrefix Sum |
| Avoid Flood in The City | Medium | 39.0% | 12.5% | ArrayHash TableBinary Search+2 |
| Minimum Number of Refueling Stops | Hard | 41.1% | 12.5% | ArrayDynamic ProgrammingGreedy+1 |
| Count the Number of Infection Sequences | Hard | 37.2% | 12.5% | ArrayMathCombinatorics |
| Find the Minimum Amount of Time to Brew Potions | Medium | 62.7% | 12.5% | ArraySimulationPrefix Sum |
| Compute Decimal Representation | Easy | 64.6% | 12.5% | ArrayMath |
| Can I Win | Medium | 31.0% | 12.5% | MathDynamic ProgrammingBit Manipulation+3 |
| Number of Pairs Satisfying Inequality | Hard | 46.8% | 12.5% | ArrayBinary SearchDivide and Conquer+4 |
| Min Cost to Connect All Points | Medium | 70.3% | 12.5% | ArrayUnion-FindGraph Theory+1 |
| Minimum Genetic Mutation | Medium | 56.4% | 12.5% | Hash TableStringBreadth-First Search |
| Find Sum of Array Product of Magical Sequences | Hard | 62.0% | 12.5% | ArrayMathDynamic Programming+3 |
| Lowest Common Ancestor of a Binary Tree IV | Medium | 79.5% | 12.5% | |
| Find Resultant Array After Removing Anagrams | Easy | 69.9% | 12.5% | ArrayHash TableString+1 |
| Minimum Difference Between Highest and Lowest of K Scores | Easy | 66.2% | 12.5% | ArraySliding WindowSorting |
| The Two Sneaky Numbers of Digitville | Easy | 89.9% | 12.5% | ArrayHash TableMath |
| 4Sum II | Medium | 57.8% | 12.5% | ArrayHash Table |
| Eliminate Maximum Number of Monsters | Medium | 51.0% | 12.5% | ArrayGreedySorting |
| Design an Ordered Stream | Easy | 82.6% | 12.5% | ArrayHash TableDesign+1 |
| Finding Pairs With a Certain Sum | Medium | 61.6% | 12.5% | ArrayHash TableDesign |
| Maximum Number of Distinct Elements After Operations | Medium | 52.2% | 12.5% | ArrayGreedySorting |
| Maximum Height by Stacking Cuboids | Hard | 61.7% | 12.5% | ArrayDynamic ProgrammingSorting |
| Maximum Frequency of an Element After Performing Operations I | Medium | 40.1% | 12.5% | ArrayBinary SearchSliding Window+2 |
| Check If Digits Are Equal in String After Operations I | Easy | 82.5% | 12.5% | MathStringSimulation+2 |
| Next Greater Numerically Balanced Number | Medium | 63.0% | 12.5% | Hash TableMathBacktracking+2 |
| Length of the Longest Valid Substring | Hard | 38.2% | 12.5% | ArrayHash TableString+1 |
| Count Number of Rectangles Containing Each Point | Medium | 37.4% | 12.5% | ArrayHash TableBinary Search+2 |
| Make Array Elements Equal to Zero | Easy | 68.3% | 12.5% | ArraySimulationPrefix Sum |
| Minimum Number of Increments on Subarrays to Form a Target Array | Hard | 78.1% | 12.5% | ArrayDynamic ProgrammingStack+2 |
| Number of Days Between Two Dates | Easy | 52.3% | 12.5% | MathString |
| Count Unguarded Cells in the Grid | Medium | 69.0% | 12.5% | ArrayMatrixSimulation |
| Find X-Sum of All K-Long Subarrays I | Easy | 76.1% | 12.5% | ArrayHash TableSliding Window+1 |
| Design a Text Editor | Hard | 49.9% | 12.5% | Linked ListStringStack+3 |
| Power Grid Maintenance | Medium | 56.3% | 12.5% | ArrayHash TableDepth-First Search+5 |
| Design Snake Game | Medium | 40.0% | 12.5% | |
| Find Books with No Available Copies | Easy | 53.4% | 12.5% | Database |
| Cherry Pickup II | Hard | 72.3% | 12.5% | ArrayDynamic ProgrammingMatrix |
| Find Missing Observations | Medium | 57.4% | 12.5% | ArrayMathSimulation |
| Stone Game | Medium | 72.6% | 12.5% | ArrayMathDynamic Programming+1 |
| Minimum Operations to Convert All Elements to Zero | Medium | 52.9% | 12.5% | ArrayHash TableStack+2 |
| Substrings of Size Three with Distinct Characters | Easy | 76.5% | 12.5% | Hash TableStringSliding Window+1 |
| Maximum Number of Operations to Move Ones to the End | Medium | 67.1% | 12.5% | StringGreedyCounting |
| RLE Iterator | Medium | 59.2% | 12.5% | ArrayDesignCounting+1 |
| Minimum Absolute Difference Between Elements With Constraint | Medium | 37.1% | 12.5% | ArrayBinary SearchOrdered Set |
| Increment Submatrices by One | Medium | 73.8% | 12.5% | ArrayMatrixPrefix Sum |
| Restore the Array From Adjacent Pairs | Medium | 75.0% | 12.5% | ArrayHash TableDepth-First Search |
| Check If All 1's Are at Least Length K Places Away | Easy | 64.3% | 12.5% | Array |
| The K Weakest Rows in a Matrix | Easy | 74.3% | 12.5% | ArrayBinary SearchSorting+2 |
| Keep Multiplying Found Values by Two | Easy | 75.1% | 12.5% | ArrayHash TableSorting+1 |
| 3Sum Smaller | Medium | 51.3% | 12.5% | |
| Unpopular Books | Medium | 43.4% | 12.5% | |
| Can Make Arithmetic Progression From Sequence | Easy | 69.2% | 12.5% | ArraySorting |
| Set Intersection Size At Least Two | Hard | 57.9% | 12.5% | ArrayGreedySorting |
| Tree Node | Medium | 75.2% | 12.5% | Database |
| The Score of Students Solving Math Expression | Hard | 33.8% | 12.5% | ArrayHash TableMath+4 |
| Greatest Sum Divisible by Three | Medium | 57.1% | 12.5% | ArrayDynamic ProgrammingGreedy+1 |
| Maximum Binary Tree | Medium | 86.3% | 12.5% | ArrayDivide and ConquerStack+3 |
| Shortest Distance in a Plane | Medium | 61.0% | 12.5% | |
| Smallest Integer Divisible by K | Medium | 54.3% | 12.5% | Hash TableMath |
| Minimum Length of String After Deleting Similar Ends | Medium | 56.0% | 12.5% | Two PointersString |
| Contains Duplicate III | Hard | 24.4% | 12.5% | ArraySliding WindowSorting+2 |
| Flipping an Image | Easy | 83.6% | 12.5% | ArrayTwo PointersBit Manipulation+2 |
| Capital Gain/Loss | Medium | 84.6% | 12.5% | Database |
| Maximum Subarray Sum With Length Divisible by K | Medium | 49.6% | 12.5% | ArrayHash TablePrefix Sum |
| Longest Even Odd Subarray With Threshold | Easy | 31.6% | 12.5% | ArraySliding Window |
| Maximum Running Time of N Computers | Hard | 56.4% | 12.5% | ArrayBinary SearchGreedy+1 |
| Corporate Flight Bookings | Medium | 66.4% | 12.5% | ArrayPrefix Sum |
| Pairs of Songs With Total Durations Divisible by 60 | Medium | 53.4% | 12.5% | ArrayHash TableCounting |
| Count Partitions With Max-Min Difference at Most K | Medium | 58.9% | 12.5% | ArrayDynamic ProgrammingQueue+3 |
| Count Number of Trapezoids I | Medium | 48.0% | 12.5% | ArrayHash TableMath+1 |
| Minimum Operations to Make Array Elements Zero | Hard | 60.4% | 12.5% | ArrayMathBit Manipulation |
| Return Length of Arguments Passed | Easy | 94.5% | 12.5% | |
| Count Special Triplets | Medium | 47.1% | 12.5% | ArrayHash TableCounting |
| Count the Number of Computer Unlocking Permutations | Medium | 59.0% | 12.5% | ArrayMathBrainteaser+1 |
| Jump Game VI | Medium | 46.4% | 12.5% | ArrayDynamic ProgrammingQueue+2 |
| Decoded String at Index | Medium | 37.2% | 12.5% | StringStack |
| Find and Replace Pattern | Medium | 77.0% | 12.5% | ArrayHash TableString |
| Nth Highest Salary | Medium | 38.8% | 12.5% | Database |
| Best Time to Buy and Sell Stock V | Medium | 60.8% | 12.5% | ArrayDynamic Programming |
| Minimum Operations to Make Array Sum Divisible by K | Easy | 92.4% | 12.5% | ArrayMath |
| Delete Columns to Make Sorted | Easy | 78.0% | 12.5% | ArrayString |
| Find Minimum in Rotated Sorted Array II | Hard | 44.6% | 12.5% | ArrayBinary Search |
| Two Best Non-Overlapping Events | Medium | 64.0% | 12.5% | ArrayBinary SearchDynamic Programming+2 |
| Shortest Path with Alternating Colors | Medium | 47.7% | 12.5% | Breadth-First SearchGraph Theory |
| Maximum Product of Three Elements After One Replacement | Medium | 47.0% | 12.5% | ArrayMathGreedy+1 |
| Split and Merge Array Transformation | Medium | 58.6% | 12.5% | ArrayHash TableBreadth-First Search |
| Minimum Penalty for a Shop | Medium | 71.2% | 12.5% | StringPrefix Sum |
| Rearrange Products Table | Easy | 85.5% | 12.5% | Database |
| Maximum Profit from Trading Stocks with Discounts | Hard | 56.8% | 12.5% | ArrayDynamic ProgrammingTree+1 |
| Binary Tree Tilt | Easy | 65.3% | 12.5% | TreeDepth-First SearchBinary Tree |
| Minimum Bit Flips to Convert Number | Easy | 87.8% | 12.5% | Bit Manipulation |
| Analyze User Website Visit Pattern | Medium | 44.2% | 12.5% | |
| Last Day Where You Can Still Cross | Hard | 68.6% | 12.5% | ArrayBinary SearchDepth-First Search+3 |
| N-Repeated Element in Size 2N Array | Easy | 79.8% | 12.5% | ArrayHash Table |
| Number of Ways to Paint N × 3 Grid | Hard | 80.5% | 12.5% | Dynamic Programming |
| Fair Candy Swap | Easy | 64.5% | 12.5% | ArrayHash TableBinary Search+1 |
| Four Divisors | Medium | 56.6% | 12.5% | ArrayMath |
| Maximum Matrix Sum | Medium | 67.6% | 12.5% | ArrayGreedyMatrix |
| Parallel Courses | Medium | 62.0% | 12.5% | |
| Maximum Product of Splitted Binary Tree | Medium | 55.5% | 12.5% | TreeDepth-First SearchBinary Tree |
| Employee Free Time | Hard | 72.8% | 12.5% | |
| Max Dot Product of Two Subsequences | Hard | 69.3% | 12.5% | ArrayDynamic Programming |
| Minimum ASCII Delete Sum for Two Strings | Medium | 70.9% | 12.5% | StringDynamic Programming |
| Super Ugly Number | Medium | 45.9% | 12.5% | ArrayMathDynamic Programming |
| Last Stone Weight II | Medium | 59.3% | 12.5% | ArrayDynamic Programming |
| Separate Squares I | Medium | 58.0% | 12.5% | ArrayBinary Search |
| Maximize Area of Square Hole in Grid | Medium | 61.9% | 12.5% | ArraySorting |
| Valid Palindrome IV | Medium | 75.7% | 12.5% | |
| Find the Largest Area of Square Inside Two Rectangles | Medium | 66.8% | 12.5% | ArrayMathGeometry |
| Construct the Minimum Bitwise Array II | Medium | 66.5% | 12.5% | ArrayBit Manipulation |
| Find Bottom Left Tree Value | Medium | 72.2% | 12.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Count Sub Islands | Medium | 73.0% | 12.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Minimum Pair Removal to Sort Array I | Easy | 65.3% | 12.5% | ArrayHash TableLinked List+4 |
| Minimum Falling Path Sum II | Hard | 63.2% | 12.5% | ArrayDynamic ProgrammingMatrix |
| Maximize the Confusion of an Exam | Medium | 69.7% | 12.5% | StringBinary SearchSliding Window+1 |
| Minimum Cost Path with Teleportations | Hard | 45.8% | 12.5% | ArrayDynamic ProgrammingMatrix |
| Linked List Components | Medium | 57.7% | 12.5% | ArrayHash TableLinked List |
| Minimum Number of Seconds to Make Mountain Height Zero | Medium | 36.9% | 12.5% | ArrayMathBinary Search+2 |
| Divide an Array Into Subarrays With Minimum Cost I | Easy | 80.5% | 12.5% | ArraySortingEnumeration |
| Trionic Array I | Easy | 49.5% | 12.5% | Array |
| Trionic Array II | Hard | 47.3% | 12.5% | ArrayDynamic Programming |
| Reverse Only Letters | Easy | 68.1% | 12.5% | Two PointersString |
| Minimum Removals to Balance Array | Medium | 47.9% | 12.5% | ArrayBinary SearchSliding Window+1 |
| Ugly Number III | Medium | 31.2% | 12.5% | MathBinary SearchCombinatorics+1 |
| Longest Mountain in Array | Medium | 41.8% | 12.5% | ArrayTwo PointersDynamic Programming+1 |
| Longest Happy Prefix | Hard | 51.6% | 12.5% | StringRolling HashString Matching+1 |
| Matrix Similarity After Cyclic Shifts | Easy | 59.3% | 12.5% | ArrayMathMatrix+1 |
| Longest Balanced Substring I | Medium | 69.7% | 12.5% | Hash TableStringCounting+1 |
| Longest Balanced Substring II | Medium | 42.1% | 12.5% | Hash TableStringPrefix Sum |
| Reverse Words in a String III | Easy | 83.9% | 12.5% | Two PointersString |
| Champagne Tower | Medium | 64.0% | 12.5% | Dynamic Programming |
| Largest Prime from Consecutive Prime Sum | Medium | 38.9% | 12.5% | ArrayMathNumber Theory |
| Reshape Data: Pivot | Easy | 83.2% | 12.5% | |
| Tallest Billboard | Hard | 51.8% | 12.5% | ArrayDynamic Programming |
| Stream of Characters | Hard | 51.9% | 12.5% | ArrayStringDesign+2 |
| Classes With at Least 5 Students | Easy | 63.2% | 12.5% | Database |