| Two Sum | Easy | 57.1% | 100.0% | ArrayHash Table |
| Merge Intervals | Medium | 51.2% | 86.8% | ArraySorting |
| Add Two Numbers | Medium | 48.0% | 85.4% | Linked ListMathRecursion |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 85.1% | Hash TableStringSliding Window |
| Valid Parentheses | Easy | 43.7% | 84.8% | StringStack |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 84.8% | ArrayHash TableMath+2 |
| Number of Islands | Medium | 63.8% | 84.2% | ArrayDepth-First SearchBreadth-First Search+2 |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 84.0% | ArrayDynamic Programming |
| Trapping Rain Water | Hard | 66.8% | 80.6% | ArrayTwo PointersDynamic Programming+2 |
| Longest Palindromic Substring | Medium | 37.4% | 80.1% | Two PointersStringDynamic Programming |
| Invalid Transactions | Medium | 32.1% | 79.1% | ArrayHash TableString+1 |
| 3Sum | Medium | 38.6% | 79.1% | ArrayTwo PointersSorting |
| Longest Common Prefix | Easy | 47.1% | 78.9% | ArrayStringTrie |
| Flatten a Multilevel Doubly Linked List | Medium | 62.6% | 78.8% | Linked ListDepth-First SearchDoubly-Linked List |
| Word Search | Medium | 46.9% | 78.2% | ArrayStringBacktracking+2 |
| Median of Two Sorted Arrays | Hard | 46.0% | 77.3% | ArrayBinary SearchDivide and Conquer |
| Majority Element | Easy | 66.1% | 76.3% | ArrayHash TableDivide and Conquer+2 |
| Container With Most Water | Medium | 59.6% | 75.6% | ArrayTwo PointersGreedy |
| Reverse Integer | Medium | 31.5% | 75.6% | Math |
| Decode String | Medium | 62.3% | 75.4% | StringStackRecursion |
| Merge Sorted Array | Easy | 54.4% | 75.4% | ArrayTwo PointersSorting |
| Valid Anagram | Easy | 67.8% | 74.8% | Hash TableStringSorting |
| Remove Duplicates from Sorted Array | Easy | 62.3% | 73.4% | ArrayTwo Pointers |
| Palindrome Number | Easy | 60.3% | 72.9% | Math |
| Merge Two Sorted Lists | Easy | 68.0% | 72.4% | Linked ListRecursion |
| LRU Cache | Medium | 46.8% | 72.2% | Hash TableLinked ListDesign+1 |
| Roman to Integer | Easy | 66.3% | 72.2% | Hash TableMathString |
| Subarray Sum Equals K | Medium | 46.8% | 71.9% | ArrayHash TablePrefix Sum |
| Design Underground System | Medium | 74.4% | 71.9% | Hash TableStringDesign |
| Longest Consecutive Sequence | Medium | 47.0% | 71.9% | ArrayHash TableUnion-Find |
| Search in Rotated Sorted Array | Medium | 44.1% | 71.4% | ArrayBinary Search |
| Min Stack | Medium | 57.7% | 70.9% | StackDesign |
| Maximum Subarray | Medium | 53.0% | 70.6% | ArrayDivide and ConquerDynamic Programming |
| Group Anagrams | Medium | 72.2% | 69.7% | ArrayHash TableString+1 |
| Subsets | Medium | 82.1% | 69.7% | ArrayBacktrackingBit Manipulation |
| Next Permutation | Medium | 44.8% | 68.9% | ArrayTwo Pointers |
| Move Zeroes | Easy | 63.6% | 67.9% | ArrayTwo Pointers |
| First Unique Character in a String | Easy | 65.1% | 67.6% | Hash TableStringQueue+1 |
| Rotate Image | Medium | 79.4% | 67.0% | ArrayMathMatrix |
| Generate Parentheses | Medium | 78.3% | 66.3% | StringDynamic ProgrammingBacktracking |
| Climbing Stairs | Easy | 53.9% | 65.6% | MathDynamic ProgrammingMemoization |
| Rotate Array | Medium | 44.5% | 65.6% | ArrayMathTwo Pointers |
| Meeting Rooms II | Medium | 52.6% | 65.2% | ArrayTwo PointersGreedy+3 |
| Find Peak Element | Medium | 46.8% | 65.2% | ArrayBinary Search |
| Validate Binary Search Tree | Medium | 35.4% | 65.2% | TreeDepth-First SearchBinary Search Tree+1 |
| Reverse Linked List | Easy | 80.3% | 64.8% | Linked ListRecursion |
| Number of Ships in a Rectangle | Hard | 68.9% | 64.8% | ArrayDivide and ConquerInteractive |
| Word Break II | Hard | 55.1% | 63.7% | ArrayHash TableString+4 |
| Create Hello World Function | Easy | 82.0% | 63.7% | |
| Valid Palindrome | Easy | 52.8% | 63.3% | Two PointersString |
| Koko Eating Bananas | Medium | 49.7% | 63.3% | ArrayBinary Search |
| Coin Change | Medium | 48.0% | 62.9% | ArrayDynamic ProgrammingBreadth-First Search |
| String to Integer (atoi) | Medium | 20.6% | 62.9% | String |
| Find First and Last Position of Element in Sorted Array | Medium | 48.4% | 62.9% | ArrayBinary Search |
| Single Number | Easy | 77.4% | 62.5% | ArrayBit Manipulation |
| Longest Repeating Character Replacement | Medium | 59.1% | 62.5% | Hash TableStringSliding Window |
| Sqrt(x) | Easy | 41.4% | 62.5% | MathBinary Search |
| Pascal's Triangle | Easy | 78.7% | 62.5% | ArrayDynamic Programming |
| 4Sum | Medium | 40.0% | 62.0% | ArrayTwo PointersSorting |
| Sort Integers by The Power Value | Medium | 71.6% | 62.0% | Dynamic ProgrammingMemoizationSorting |
| Contains Duplicate | Easy | 64.1% | 62.0% | ArrayHash TableSorting |
| Jump Game | Medium | 40.5% | 62.0% | ArrayDynamic ProgrammingGreedy |
| Pow(x, n) | Medium | 38.3% | 61.6% | MathRecursion |
| Sort Colors | Medium | 69.2% | 61.2% | ArrayTwo PointersSorting |
| All Paths From Source to Target | Medium | 83.5% | 60.7% | BacktrackingDepth-First SearchBreadth-First Search+1 |
| Remove Element | Easy | 61.4% | 60.7% | ArrayTwo Pointers |
| Single Element in a Sorted Array | Medium | 59.2% | 60.7% | ArrayBinary Search |
| Evaluate Division | Medium | 64.0% | 60.2% | ArrayStringDepth-First Search+4 |
| Check if Array Is Sorted and Rotated | Easy | 55.7% | 60.2% | Array |
| Plus One | Easy | 49.6% | 59.8% | ArrayMath |
| Remove All Adjacent Duplicates in String II | Medium | 60.9% | 59.8% | StringStack |
| House Robber | Medium | 52.9% | 59.3% | ArrayDynamic Programming |
| Word Break | Medium | 49.1% | 59.3% | ArrayHash TableString+3 |
| Spiral Matrix | Medium | 56.2% | 59.3% | ArrayMatrixSimulation |
| Palindrome Partitioning | Medium | 73.7% | 59.3% | StringDynamic ProgrammingBacktracking |
| Product of Array Except Self | Medium | 68.6% | 58.8% | ArrayPrefix Sum |
| Two City Scheduling | Medium | 68.4% | 58.2% | ArrayGreedySorting |
| Find the Index of the First Occurrence in a String | Easy | 46.3% | 58.2% | Two PointersStringString Matching |
| Merge k Sorted Lists | Hard | 58.9% | 58.2% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Remove Letter To Equalize Frequency | Easy | 19.2% | 58.2% | Hash TableStringCounting |
| Binary Tree Level Order Traversal | Medium | 72.2% | 58.2% | TreeBreadth-First SearchBinary Tree |
| Search Insert Position | Easy | 50.7% | 57.7% | ArrayBinary Search |
| Design an Ordered Stream | Easy | 82.6% | 57.7% | ArrayHash TableDesign+1 |
| Max Consecutive Ones | Easy | 64.6% | 57.1% | Array |
| Palindrome Linked List | Easy | 57.5% | 57.1% | Linked ListTwo PointersStack+1 |
| Combine Two Tables | Easy | 79.2% | 57.1% | Database |
| Minimum Remove to Make Valid Parentheses | Medium | 71.3% | 57.1% | StringStack |
| Binary Tree Vertical Order Traversal | Medium | 57.8% | 57.1% | Hash TableTreeDepth-First Search+3 |
| Set Matrix Zeroes | Medium | 62.5% | 56.6% | ArrayHash TableMatrix |
| Next Greater Element I | Easy | 75.8% | 56.6% | ArrayHash TableStack+1 |
| Reverse Words in a String | Medium | 55.6% | 56.6% | Two PointersString |
| Zigzag Conversion | Medium | 53.6% | 56.0% | String |
| 3Sum Closest | Medium | 48.1% | 56.0% | ArrayTwo PointersSorting |
| Rotting Oranges | Medium | 58.2% | 55.4% | ArrayBreadth-First SearchMatrix |
| Recyclable and Low Fat Products | Easy | 88.7% | 55.4% | Database |
| Copy List with Random Pointer | Medium | 62.4% | 55.4% | Hash TableLinked List |
| Kth Largest Element in an Array | Medium | 68.8% | 55.4% | ArrayDivide and ConquerSorting+2 |
| Linked List Cycle | Easy | 53.9% | 55.4% | Hash TableLinked ListTwo Pointers |
| Best Time to Buy and Sell Stock II | Medium | 70.8% | 55.4% | ArrayDynamic ProgrammingGreedy |
| Isomorphic Strings | Easy | 48.1% | 54.8% | Hash TableString |
| Largest Rectangle in Histogram | Hard | 49.4% | 54.8% | ArrayStackMonotonic Stack |
| Symmetric Tree | Easy | 60.8% | 54.8% | TreeDepth-First SearchBreadth-First Search+1 |
| Balanced Binary Tree | Easy | 57.9% | 54.8% | TreeDepth-First SearchBinary Tree |
| Daily Temperatures | Medium | 68.4% | 54.8% | ArrayStackMonotonic Stack |
| Search a 2D Matrix | Medium | 53.6% | 54.8% | ArrayBinary SearchMatrix |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% | 54.8% | Hash TableTreeDepth-First Search+3 |
| Unique Paths | Medium | 66.6% | 54.8% | MathDynamic ProgrammingCombinatorics |
| Valid Triangle Number | Medium | 56.7% | 54.1% | ArrayTwo PointersBinary Search+2 |
| Number of Provinces | Medium | 70.0% | 54.1% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Candy | Hard | 48.0% | 54.1% | ArrayGreedy |
| Gas Station | Medium | 47.5% | 54.1% | ArrayGreedy |
| Rotate List | Medium | 41.2% | 54.1% | Linked ListTwo Pointers |
| Reorder List | Medium | 64.6% | 54.1% | Linked ListTwo PointersStack+1 |
| Binary Search | Easy | 60.5% | 54.1% | ArrayBinary Search |
| N-Queens | Hard | 75.0% | 54.1% | ArrayBacktracking |
| String Compression | Medium | 59.6% | 54.1% | Two PointersString |
| Contains Duplicate II | Easy | 50.8% | 53.5% | ArrayHash TableSliding Window |
| Valid Sudoku | Medium | 64.2% | 53.5% | ArrayHash TableMatrix |
| Letter Combinations of a Phone Number | Medium | 65.5% | 53.5% | Hash TableStringBacktracking |
| Missing Number | Easy | 71.7% | 53.5% | ArrayHash TableMath+3 |
| Managers with at Least 5 Direct Reports | Medium | 48.9% | 53.5% | Database |
| Merge Strings Alternately | Easy | 82.1% | 52.8% | Two PointersString |
| Add Binary | Easy | 57.7% | 52.8% | MathStringBit Manipulation+1 |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | 68.4% | 52.8% | ArrayHash TableDivide and Conquer+2 |
| Count Unhappy Friends | Medium | 62.5% | 52.8% | ArraySimulation |
| Combination Sum | Medium | 76.1% | 52.8% | ArrayBacktracking |
| Swap Nodes in Pairs | Medium | 69.0% | 52.1% | Linked ListRecursion |
| Intersection of Two Arrays | Easy | 77.5% | 52.1% | ArrayHash TableTwo Pointers+2 |
| Length of Last Word | Easy | 58.3% | 52.1% | String |
| Design A Leaderboard | Medium | 68.1% | 52.1% | Hash TableDesignSorting |
| Add Two Numbers II | Medium | 62.4% | 52.1% | Linked ListMathStack |
| Top K Frequent Elements | Medium | 65.9% | 52.1% | ArrayHash TableDivide and Conquer+5 |
| Maximum Product Subarray | Medium | 36.0% | 52.1% | ArrayDynamic Programming |
| Longest Increasing Subsequence | Medium | 59.1% | 52.1% | ArrayBinary SearchDynamic Programming |
| Find the Duplicate Number | Medium | 64.0% | 52.1% | ArrayTwo PointersBinary Search+1 |
| Same Tree | Easy | 66.7% | 52.1% | TreeDepth-First SearchBreadth-First Search+1 |
| Populating Next Right Pointers in Each Node | Medium | 66.9% | 52.1% | Linked ListTreeDepth-First Search+2 |
| Frequency of the Most Frequent Element | Medium | 44.6% | 52.1% | ArrayBinary SearchGreedy+3 |
| Number of Recent Calls | Easy | 78.2% | 51.3% | DesignQueueData Stream |
| Word Ladder | Hard | 44.9% | 51.3% | Hash TableStringBreadth-First Search |
| Reverse String | Easy | 80.6% | 51.3% | Two PointersString |
| Lexicographical Numbers | Medium | 76.2% | 51.3% | Depth-First SearchTrie |
| Integer to Roman | Medium | 70.5% | 50.5% | Hash TableMathString |
| Regular Expression Matching | Hard | 30.5% | 50.5% | StringDynamic ProgrammingRecursion |
| Kth Smallest Element in a BST | Medium | 76.5% | 50.5% | TreeDepth-First SearchBinary Search Tree+1 |
| Find the Winner of the Circular Game | Medium | 82.2% | 50.5% | ArrayMathRecursion+2 |
| Remove Nth Node From End of List | Medium | 51.0% | 50.5% | Linked ListTwo Pointers |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.2% | 50.5% | TreeBreadth-First SearchBinary Tree |
| Next Greater Element II | Medium | 67.9% | 49.7% | ArrayStackMonotonic Stack |
| Jump Game II | Medium | 42.5% | 49.7% | ArrayDynamic ProgrammingGreedy |
| Minimum Size Subarray Sum | Medium | 51.1% | 49.7% | ArrayBinary SearchSliding Window+1 |
| Sliding Window Maximum | Hard | 48.5% | 49.7% | ArrayQueueSliding Window+2 |
| Permutations | Medium | 81.7% | 49.7% | ArrayBacktracking |
| Unique Paths II | Medium | 44.2% | 49.7% | ArrayDynamic ProgrammingMatrix |
| Edit Distance | Medium | 60.2% | 49.7% | StringDynamic Programming |
| Fibonacci Number | Easy | 73.9% | 49.7% | MathDynamic ProgrammingRecursion+1 |
| H-Index | Medium | 41.2% | 49.7% | ArraySortingCounting Sort |
| Remove Duplicates from Sorted List | Easy | 56.3% | 48.9% | Linked List |
| Two Sum II - Input Array Is Sorted | Medium | 64.6% | 48.9% | ArrayTwo PointersBinary Search |
| Capacity To Ship Packages Within D Days | Medium | 73.5% | 48.9% | ArrayBinary Search |
| Peak Index in a Mountain Array | Medium | 66.9% | 48.9% | ArrayBinary Search |
| Happy Number | Easy | 59.3% | 48.9% | Hash TableMathTwo Pointers |
| Design Browser History | Medium | 78.2% | 48.9% | ArrayLinked ListStack+3 |
| Populating Next Right Pointers in Each Node II | Medium | 57.1% | 48.9% | Linked ListTreeDepth-First Search+2 |
| Rotate String | Easy | 65.1% | 48.0% | StringString Matching |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.8% | 48.0% | TreeDepth-First SearchBinary Tree |
| Reverse Vowels of a String | Easy | 60.7% | 48.0% | Two PointersString |
| Wildcard Matching | Hard | 31.4% | 48.0% | StringDynamic ProgrammingGreedy+1 |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 48.0% | Hash TableStringDesign+1 |
| Evaluate Reverse Polish Notation | Medium | 57.1% | 47.1% | ArrayMathStack |
| Reverse Nodes in k-Group | Hard | 65.4% | 47.1% | Linked ListRecursion |
| Lowest Common Ancestor of a Binary Search Tree | Medium | 70.1% | 47.1% | TreeDepth-First SearchBinary Search Tree+1 |
| Subsets II | Medium | 60.9% | 47.1% | ArrayBacktrackingBit Manipulation |
| Rising Temperature | Easy | 51.0% | 47.1% | Database |
| Partition Equal Subset Sum | Medium | 49.2% | 47.1% | ArrayDynamic Programming |
| Maximum Nesting Depth of the Parentheses | Easy | 84.8% | 47.1% | StringStack |
| Odd Even Linked List | Medium | 62.3% | 47.1% | Linked List |
| Average Time of Process per Machine | Easy | 66.9% | 47.1% | Database |
| Sort an Array | Medium | 55.9% | 46.1% | ArrayDivide and ConquerSorting+5 |
| Split Array Largest Sum | Hard | 59.9% | 46.1% | ArrayBinary SearchDynamic Programming+2 |
| Delete Node in a Linked List | Medium | 83.6% | 46.1% | Linked List |
| Top K Frequent Words | Medium | 60.0% | 46.1% | ArrayHash TableString+5 |
| Online Stock Span | Medium | 68.7% | 46.1% | StackDesignMonotonic Stack+1 |
| Minimum Number of Steps to Make Two Strings Anagram | Medium | 82.5% | 46.1% | Hash TableStringCounting |
| Intersection of Two Linked Lists | Easy | 63.2% | 46.1% | Hash TableLinked ListTwo Pointers |
| Second Highest Salary | Medium | 46.4% | 45.1% | Database |
| Power of Two | Easy | 49.9% | 45.1% | MathBit ManipulationRecursion |
| Majority Element II | Medium | 55.8% | 45.1% | ArrayHash TableSorting+1 |
| Big Countries | Easy | 68.4% | 45.1% | Database |
| Article Views I | Easy | 76.7% | 45.1% | Database |
| Diameter of Binary Tree | Easy | 65.1% | 45.1% | TreeDepth-First SearchBinary Tree |
| Sudoku Solver | Hard | 65.4% | 45.1% | ArrayHash TableBacktracking+1 |
| Triangle | Medium | 59.9% | 45.1% | ArrayDynamic Programming |
| Maximum Depth of Binary Tree | Easy | 77.9% | 45.1% | TreeDepth-First SearchBreadth-First Search+1 |
| Course Schedule | Medium | 50.8% | 45.1% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Find Missing and Repeated Values | Easy | 83.3% | 45.1% | ArrayHash TableMath+1 |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 45.1% | StringTreeDepth-First Search+3 |
| Factorial Trailing Zeroes | Medium | 46.2% | 45.1% | Math |
| Fruit Into Baskets | Medium | 50.5% | 44.0% | ArrayHash TableSliding Window |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 44.0% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Combination Sum II | Medium | 59.0% | 44.0% | ArrayBacktracking |
| Reverse Pairs | Hard | 33.7% | 44.0% | ArrayBinary SearchDivide and Conquer+4 |
| Divide Two Integers | Medium | 19.4% | 44.0% | MathBit Manipulation |
| Search in Rotated Sorted Array II | Medium | 39.8% | 44.0% | ArrayBinary Search |
| Max Consecutive Ones III | Medium | 67.3% | 44.0% | ArrayBinary SearchSliding Window+1 |
| Monthly Transactions I | Medium | 58.9% | 44.0% | Database |
| Squares of a Sorted Array | Easy | 73.6% | 42.9% | ArrayTwo PointersSorting |
| Longest Valid Parentheses | Hard | 38.1% | 42.9% | StringDynamic ProgrammingStack |
| Maximum Average Subarray I | Easy | 47.1% | 42.9% | ArraySliding Window |
| Remove Duplicates from Sorted Array II | Medium | 64.3% | 42.9% | ArrayTwo Pointers |
| Employees Earning More Than Their Managers | Easy | 72.9% | 42.9% | Database |
| Implement Magic Dictionary | Medium | 57.7% | 42.9% | Hash TableStringDepth-First Search+2 |
| Minimum Number of Days to Make m Bouquets | Medium | 56.3% | 42.9% | ArrayBinary Search |
| Largest Number | Medium | 42.6% | 42.9% | ArrayStringGreedy+1 |
| Remove Linked List Elements | Easy | 53.9% | 42.9% | Linked ListRecursion |
| Middle of the Linked List | Easy | 81.6% | 42.9% | Linked ListTwo Pointers |
| Students and Examinations | Easy | 61.0% | 42.9% | Database |
| Implement Queue using Stacks | Easy | 69.4% | 42.9% | StackDesignQueue |
| Sort Characters By Frequency | Medium | 75.1% | 41.7% | Hash TableStringSorting+3 |
| Surrounded Regions | Medium | 44.8% | 41.7% | ArrayDepth-First SearchBreadth-First Search+2 |
| Concatenation of Array | Easy | 90.5% | 41.7% | ArraySimulation |
| Binary Subarrays With Sum | Medium | 68.3% | 41.7% | ArrayHash TableSliding Window+1 |
| Next Greater Element III | Medium | 35.2% | 41.7% | MathTwo PointersString |
| Rearrange Array Elements by Sign | Medium | 84.5% | 41.7% | ArrayTwo PointersSimulation |
| Minimum Absolute Difference | Easy | 75.0% | 41.7% | ArraySorting |
| Search a 2D Matrix II | Medium | 56.9% | 41.7% | ArrayBinary SearchDivide and Conquer+1 |
| Implement Stack using Queues | Easy | 69.4% | 41.7% | StackDesignQueue |
| Binary Tree Right Side View | Medium | 69.5% | 41.7% | TreeDepth-First SearchBreadth-First Search+1 |
| Minimum Window Substring | Hard | 47.0% | 41.7% | Hash TableStringSliding Window |
| Count Primes | Medium | 35.8% | 41.7% | ArrayMathEnumeration+1 |
| Add Digits | Easy | 68.6% | 41.7% | MathSimulationNumber Theory |
| Average Selling Price | Easy | 37.1% | 41.7% | Database |
| Permutation in String | Medium | 48.5% | 40.4% | Hash TableTwo PointersString+1 |
| Asteroid Collision | Medium | 47.2% | 40.4% | ArrayStackSimulation |
| Course Schedule II | Medium | 55.0% | 40.4% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 40.4% | ArrayBinary SearchDynamic Programming+1 |
| Maximal Rectangle | Hard | 58.1% | 40.4% | ArrayDynamic ProgrammingStack+2 |
| House Robber II | Medium | 44.6% | 40.4% | ArrayDynamic Programming |
| Sort List | Medium | 63.9% | 40.4% | Linked ListTwo PointersDivide and Conquer+2 |
| First Missing Positive | Hard | 42.5% | 40.4% | ArrayHash Table |
| Remove Duplicates from Sorted List II | Medium | 51.3% | 40.4% | Linked ListTwo Pointers |
| Diagonal Traverse | Medium | 67.0% | 40.4% | ArrayMatrixSimulation |
| Remove K Digits | Medium | 36.4% | 40.4% | StringStackGreedy+1 |
| Arranging Coins | Easy | 48.0% | 40.4% | MathBinary Search |
| Binary Tree Inorder Traversal | Easy | 79.7% | 40.4% | StackTreeDepth-First Search+1 |
| Flatten Binary Tree to Linked List | Medium | 70.2% | 40.4% | Linked ListStackTree+2 |
| Sort Array by Increasing Frequency | Easy | 80.7% | 40.4% | ArrayHash TableSorting |
| Kill Process | Medium | 70.3% | 40.4% | ArrayHash TableTree+2 |
| Perfect Squares | Medium | 56.3% | 39.0% | MathDynamic ProgrammingBreadth-First Search |
| Accounts Merge | Medium | 60.9% | 39.0% | ArrayHash TableString+4 |
| Ransom Note | Easy | 65.7% | 39.0% | Hash TableStringCounting |
| Contiguous Array | Medium | 50.8% | 39.0% | ArrayHash TablePrefix Sum |
| Fizz Buzz | Easy | 75.3% | 39.0% | MathStringSimulation |
| Non-overlapping Intervals | Medium | 56.7% | 39.0% | ArrayDynamic ProgrammingGreedy+1 |
| Linked List Cycle II | Medium | 57.3% | 39.0% | Hash TableLinked ListTwo Pointers |
| Sum of Subarray Minimums | Medium | 38.3% | 39.0% | ArrayDynamic ProgrammingStack+1 |
| Number of Digit One | Hard | 37.7% | 39.0% | MathDynamic ProgrammingRecursion |
| Add Two Integers | Easy | 87.9% | 39.0% | Math |
| Shortest Path in Binary Matrix | Medium | 51.1% | 39.0% | ArrayBreadth-First SearchMatrix |
| Kth Missing Positive Number | Easy | 63.2% | 39.0% | ArrayBinary Search |
| Path Sum II | Medium | 61.8% | 39.0% | BacktrackingTreeDepth-First Search+1 |
| Best Time to Buy and Sell Stock with Transaction Fee | Medium | 71.7% | 39.0% | ArrayDynamic ProgrammingGreedy |
| Basic Calculator | Hard | 46.6% | 37.5% | MathStringStack+1 |
| Find Median from Data Stream | Hard | 54.2% | 37.5% | Two PointersDesignSorting+2 |
| Immediate Food Delivery II | Medium | 55.7% | 37.5% | Database |
| Simplify Path | Medium | 50.0% | 37.5% | StringStack |
| Find All Anagrams in a String | Medium | 53.3% | 37.5% | Hash TableStringSliding Window |
| Reverse String II | Easy | 53.4% | 37.5% | Two PointersString |
| Maximum Sum of Distinct Subarrays With Length K | Medium | 42.8% | 37.5% | ArrayHash TableSliding Window |
| Increasing Triplet Subsequence | Medium | 39.2% | 37.5% | ArrayGreedy |
| Subarray Sums Divisible by K | Medium | 56.1% | 37.5% | ArrayHash TablePrefix Sum |
| Single Number II | Medium | 66.7% | 37.5% | ArrayBit Manipulation |
| Reordered Power of 2 | Medium | 66.0% | 37.5% | Hash TableMathSorting+2 |
| Employee Bonus | Easy | 77.2% | 37.5% | Database |
| Shortest Palindrome | Hard | 41.9% | 37.5% | StringRolling HashString Matching+1 |
| Even Odd Tree | Medium | 67.0% | 37.5% | TreeBreadth-First SearchBinary Tree |
| Cousins in Binary Tree | Easy | 59.1% | 37.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Trim a Binary Search Tree | Medium | 66.6% | 37.5% | TreeDepth-First SearchBinary Search Tree+1 |
| First Bad Version | Easy | 46.9% | 35.9% | Binary SearchInteractive |
| Find Customer Referee | Easy | 72.6% | 35.9% | Database |
| Find Minimum in Rotated Sorted Array | Medium | 53.8% | 35.9% | ArrayBinary Search |
| Count and Say | Medium | 62.3% | 35.9% | String |
| Find in Mountain Array | Hard | 41.2% | 35.9% | ArrayBinary SearchInteractive |
| Dot Product of Two Sparse Vectors | Medium | 89.9% | 35.9% | ArrayHash TableTwo Pointers+1 |
| Consecutive Numbers | Medium | 47.9% | 35.9% | Database |
| Design Hit Counter | Medium | 69.6% | 35.9% | ArrayBinary SearchDesign+2 |
| Queries Quality and Percentage | Easy | 52.3% | 35.9% | Database |
| Minimum Depth of Binary Tree | Easy | 52.4% | 35.9% | TreeDepth-First SearchBreadth-First Search+1 |
| Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 23.0% | 35.9% | ArrayTwo PointersBinary Search+5 |
| Assign Cookies | Easy | 54.7% | 35.9% | ArrayTwo PointersGreedy+1 |
| Target Sum | Medium | 51.9% | 35.9% | ArrayDynamic ProgrammingBacktracking |
| Remove Outermost Parentheses | Easy | 86.9% | 35.9% | StringStack |
| Count Good Numbers | Medium | 57.4% | 35.9% | MathRecursion |
| Confirmation Rate | Medium | 61.7% | 35.9% | Database |
| Maximum Swap | Medium | 51.9% | 35.9% | MathGreedy |
| Reverse Linked List II | Medium | 51.0% | 35.9% | Linked List |
| Is Subsequence | Easy | 48.9% | 35.9% | Two PointersStringDynamic Programming |
| Replace Employee ID With The Unique Identifier | Easy | 83.5% | 35.9% | Database |
| Product Price at a Given Date | Medium | 57.7% | 35.9% | Database |
| Shortest Path to Get Food | Medium | 57.1% | 35.9% | ArrayBreadth-First SearchMatrix |
| Substring with Concatenation of All Words | Hard | 34.0% | 34.1% | Hash TableStringSliding Window |
| Partition List | Medium | 60.6% | 34.1% | Linked ListTwo Pointers |
| Delete Node in a BST | Medium | 54.2% | 34.1% | TreeBinary Search TreeBinary Tree |
| Summary Ranges | Easy | 53.9% | 34.1% | Array |
| Combinations | Medium | 74.2% | 34.1% | Backtracking |
| Basic Calculator II | Medium | 46.7% | 34.1% | MathStringStack |
| Boats to Save People | Medium | 61.4% | 34.1% | ArrayTwo PointersGreedy+1 |
| Power of Three | Easy | 50.7% | 34.1% | MathRecursion |
| Valid Parenthesis String | Medium | 39.8% | 34.1% | StringDynamic ProgrammingStack+1 |
| Redundant Connection | Medium | 67.3% | 34.1% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Find the Difference | Easy | 60.1% | 34.1% | Hash TableStringBit Manipulation+1 |
| Repeated DNA Sequences | Medium | 52.9% | 34.1% | Hash TableStringBit Manipulation+3 |
| Lemonade Change | Easy | 58.9% | 34.1% | ArrayGreedy |
| Flood Fill | Easy | 67.9% | 34.1% | ArrayDepth-First SearchBreadth-First Search+1 |
| Unique Number of Occurrences | Easy | 78.6% | 34.1% | ArrayHash Table |
| Permutations II | Medium | 63.0% | 34.1% | ArrayBacktrackingSorting |
| Customers Who Never Order | Easy | 71.5% | 34.1% | Database |
| Sparse Matrix Multiplication | Medium | 69.2% | 34.1% | ArrayHash TableMatrix |
| Exchange Seats | Medium | 73.8% | 34.1% | Database |
| Maximum Width of Binary Tree | Medium | 45.3% | 34.1% | TreeDepth-First SearchBreadth-First Search+1 |
| Longest Common Subsequence | Medium | 58.9% | 34.1% | StringDynamic Programming |
| Build Array from Permutation | Easy | 91.1% | 34.1% | ArraySimulation |
| Range Sum Query - Immutable | Easy | 71.4% | 34.1% | ArrayDesignPrefix Sum |
| Interleaving String | Medium | 43.5% | 34.1% | StringDynamic Programming |
| Allocate Mailboxes | Hard | 56.5% | 34.1% | ArrayMathDynamic Programming+1 |
| Shortest Distance to Target String in a Circular Array | Easy | 50.6% | 34.1% | ArrayString |
| Palindrome Permutation | Easy | 68.6% | 34.1% | Hash TableStringBit Manipulation |
| Contain Virus | Hard | 54.4% | 34.1% | ArrayDepth-First SearchBreadth-First Search+2 |
| Path In Zigzag Labelled Binary Tree | Medium | 75.7% | 34.1% | MathTreeBinary Tree |
| Maximum Number of Accepted Invitations | Medium | 52.3% | 34.1% | ArrayDepth-First SearchGraph Theory+1 |
| Check if All the Integers in a Range Are Covered | Easy | 50.8% | 34.1% | ArrayHash TablePrefix Sum |
| Truncate Sentence | Easy | 86.7% | 34.1% | ArrayString |
| Read N Characters Given read4 II - Call Multiple Times | Hard | 43.2% | 34.1% | ArraySimulationInteractive |
| Find Pivot Index | Easy | 62.1% | 32.2% | ArrayPrefix Sum |
| Duplicate Emails | Easy | 73.4% | 32.2% | Database |
| Set Mismatch | Easy | 44.2% | 32.2% | ArrayHash TableBit Manipulation+1 |
| Running Sum of 1d Array | Easy | 86.9% | 32.2% | ArrayPrefix Sum |
| Continuous Subarray Sum | Medium | 31.2% | 32.2% | ArrayHash TableMath+1 |
| Find if Path Exists in Graph | Easy | 54.8% | 32.2% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Subarrays with K Different Integers | Hard | 67.6% | 32.2% | ArrayHash TableSliding Window+1 |
| How Many Numbers Are Smaller Than the Current Number | Easy | 87.4% | 32.2% | ArrayHash TableSorting+1 |
| Remove Duplicate Letters | Medium | 52.8% | 32.2% | StringStackGreedy+1 |
| Invert Binary Tree | Easy | 79.8% | 32.2% | TreeDepth-First SearchBreadth-First Search+1 |
| Partition Array According to Given Pivot | Medium | 89.8% | 32.2% | ArrayTwo PointersSimulation |
| Permutation Sequence | Hard | 52.2% | 32.2% | MathRecursion |
| Jewels and Stones | Easy | 89.5% | 32.2% | Hash TableString |
| Sum of Two Integers | Medium | 55.1% | 32.2% | MathBit Manipulation |
| 132 Pattern | Medium | 34.5% | 32.2% | ArrayBinary SearchStack+2 |
| Multiply Strings | Medium | 43.6% | 32.2% | MathStringSimulation |
| Minimum Path Sum | Medium | 67.8% | 32.2% | ArrayDynamic ProgrammingMatrix |
| Design Search Autocomplete System | Hard | 49.7% | 32.2% | StringDepth-First SearchDesign+4 |
| Find Eventual Safe States | Medium | 70.3% | 32.2% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Sort Array By Parity | Easy | 76.5% | 32.2% | ArrayTwo PointersSorting |
| Greatest Common Divisor of Strings | Easy | 53.4% | 32.2% | MathString |
| Number of Substrings Containing All Three Characters | Medium | 73.5% | 32.2% | Hash TableStringSliding Window |
| Different Ways to Add Parentheses | Medium | 73.1% | 32.2% | MathStringDynamic Programming+2 |
| Letter Tile Possibilities | Medium | 83.5% | 32.2% | Hash TableStringBacktracking+1 |
| Largest Divisible Subset | Medium | 49.4% | 30.0% | ArrayMathDynamic Programming+1 |
| Find Numbers with Even Number of Digits | Easy | 79.7% | 30.0% | ArrayMath |
| Reorganize String | Medium | 56.8% | 30.0% | Hash TableStringGreedy+3 |
| Number of Students Unable to Eat Lunch | Easy | 79.4% | 30.0% | ArrayStackQueue+1 |
| Restaurant Growth | Medium | 58.2% | 30.0% | Database |
| Subarray Product Less Than K | Medium | 53.9% | 30.0% | ArrayBinary SearchSliding Window+1 |
| Ugly Number | Easy | 43.2% | 30.0% | Math |
| Complement of Base 10 Integer | Easy | 60.6% | 30.0% | Bit Manipulation |
| Serialize and Deserialize N-ary Tree | Hard | 68.6% | 30.0% | StringTreeDepth-First Search+1 |
| Find All Numbers Disappeared in an Array | Easy | 63.8% | 30.0% | ArrayHash Table |
| Can Place Flowers | Easy | 29.1% | 30.0% | ArrayGreedy |
| Sum of Square Numbers | Medium | 36.7% | 30.0% | MathTwo PointersBinary Search |
| Shuffle the Array | Easy | 89.0% | 30.0% | Array |
| Word Pattern | Easy | 43.8% | 30.0% | Hash TableString |
| Maximum Width Ramp | Medium | 55.8% | 30.0% | ArrayTwo PointersStack+1 |
| Nth Highest Salary | Medium | 38.8% | 30.0% | Database |
| Insert Interval | Medium | 44.8% | 30.0% | Array |
| Island Perimeter | Easy | 74.3% | 30.0% | ArrayDepth-First SearchBreadth-First Search+1 |
| Palindromic Substrings | Medium | 72.6% | 30.0% | Two PointersStringDynamic Programming |
| Number of Good Pairs | Easy | 89.8% | 30.0% | ArrayHash TableMath+1 |
| Customer Who Visited but Did Not Make Any Transactions | Easy | 67.6% | 30.0% | Database |
| Product Sales Analysis III | Medium | 45.6% | 30.0% | Database |
| Longest Strictly Increasing or Strictly Decreasing Subarray | Easy | 64.9% | 30.0% | Array |
| Friend Requests II: Who Has the Most Friends | Medium | 62.3% | 30.0% | Database |
| Heaters | Medium | 41.4% | 30.0% | ArrayTwo PointersBinary Search+1 |
| Elimination Game | Medium | 46.0% | 27.6% | MathRecursion |
| Delete Duplicate Emails | Easy | 65.6% | 27.6% | Database |
| Text Justification | Hard | 50.5% | 27.6% | ArrayStringSimulation |
| Third Maximum Number | Easy | 38.9% | 27.6% | ArraySorting |
| 01 Matrix | Medium | 53.4% | 27.6% | ArrayDynamic ProgrammingBreadth-First Search+1 |
| Path Sum | Easy | 54.5% | 27.6% | TreeDepth-First SearchBreadth-First Search+1 |
| Excel Sheet Column Title | Easy | 45.8% | 27.6% | MathString |
| Count of Smaller Numbers After Self | Hard | 43.3% | 27.6% | ArrayBinary SearchDivide and Conquer+4 |
| Find All Duplicates in an Array | Medium | 76.8% | 27.6% | ArrayHash TableSorting |
| Find K Closest Elements | Medium | 49.4% | 27.6% | ArrayTwo PointersBinary Search+3 |
| Max Area of Island | Medium | 73.8% | 27.6% | ArrayDepth-First SearchBreadth-First Search+2 |
| Minimum Add to Make Parentheses Valid | Medium | 74.4% | 27.6% | StringStackGreedy |
| Reverse Substrings Between Each Pair of Parentheses | Medium | 71.9% | 27.6% | StringStack |
| Tuple with Same Product | Medium | 70.1% | 27.6% | ArrayHash TableCounting |
| Max Sum of a Pair With Equal Sum of Digits | Medium | 66.0% | 27.6% | ArrayHash TableSorting+1 |
| Insert Delete GetRandom O(1) - Duplicates allowed | Hard | 36.4% | 27.6% | ArrayHash TableMath+2 |
| Finding 3-Digit Even Numbers | Easy | 78.8% | 27.6% | ArrayHash TableRecursion+2 |
| Primary Department for Each Employee | Easy | 73.9% | 27.6% | Database |
| Rank Scores | Medium | 67.2% | 27.6% | Database |
| Recover Binary Search Tree | Medium | 58.8% | 27.6% | TreeDepth-First SearchBinary Search Tree+1 |
| Word Ladder II | Hard | 27.5% | 27.6% | Hash TableStringBacktracking+1 |
| Clone Graph | Medium | 64.7% | 27.6% | Hash TableDepth-First SearchBreadth-First Search+1 |
| Single Number III | Medium | 70.4% | 27.6% | ArrayBit Manipulation |
| Guess Number Higher or Lower | Easy | 57.2% | 27.6% | Binary SearchInteractive |
| Candy Crush | Medium | 77.3% | 27.6% | ArrayTwo PointersMatrix+1 |
| Check if the Sentence Is Pangram | Easy | 84.1% | 27.6% | Hash TableString |
| Largest Odd Number in String | Easy | 67.0% | 27.6% | MathStringGreedy |
| Counter | Easy | 82.4% | 27.6% | |
| The Number of Employees Which Report to Each Employee | Easy | 53.0% | 27.6% | Database |
| Making A Large Island | Hard | 56.3% | 27.6% | ArrayDepth-First SearchBreadth-First Search+2 |
| Remove All Adjacent Duplicates In String | Easy | 72.8% | 27.6% | StringStack |
| Perfect Number | Easy | 48.0% | 27.6% | Math |
| Angle Between Hands of a Clock | Medium | 64.4% | 24.9% | Math |
| Can Make Arithmetic Progression From Sequence | Easy | 69.1% | 24.9% | ArraySorting |
| Time Based Key-Value Store | Medium | 49.7% | 24.9% | Hash TableStringBinary Search+1 |
| Longest Palindrome | Easy | 55.8% | 24.9% | Hash TableStringGreedy |
| Count Binary Substrings | Easy | 70.3% | 24.9% | Two PointersString |
| Sum of Root To Leaf Binary Numbers | Easy | 76.6% | 24.9% | TreeDepth-First SearchBinary Tree |
| Valid Palindrome II | Easy | 44.0% | 24.9% | Two PointersStringGreedy |
| Distinct Subsequences | Hard | 51.5% | 24.9% | StringDynamic Programming |
| Array Partition | Easy | 81.5% | 24.9% | ArrayGreedySorting+1 |
| Ugly Number II | Medium | 49.5% | 24.9% | Hash TableMathDynamic Programming+1 |
| Reconstruct Itinerary | Hard | 44.3% | 24.9% | ArrayStringDepth-First Search+4 |
| Maximum Product of Three Numbers | Easy | 45.7% | 24.9% | ArrayMathSorting |
| Cheapest Flights Within K Stops | Medium | 41.4% | 24.9% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+3 |
| Best Time to Buy and Sell Stock III | Hard | 53.2% | 24.9% | ArrayDynamic Programming |
| Trips and Users | Hard | 37.7% | 24.9% | Database |
| Movie Rating | Medium | 42.8% | 24.9% | Database |
| Decode Ways | Medium | 37.6% | 24.9% | StringDynamic Programming |
| N-Queens II | Hard | 78.2% | 24.9% | Backtracking |
| Binary Search Tree Iterator | Medium | 76.2% | 24.9% | StackTreeDesign+3 |
| Defanging an IP Address | Easy | 90.0% | 24.9% | String |
| Critical Connections in a Network | Hard | 59.3% | 24.9% | Depth-First SearchGraph TheoryBiconnected Component |
| Last Person to Fit in the Bus | Medium | 69.0% | 24.9% | Database |
| Remove All Occurrences of a Substring | Medium | 78.4% | 24.9% | StringStackSimulation |
| Score of a String | Easy | 91.4% | 24.9% | String |
| Repeated Substring Pattern | Easy | 47.9% | 24.9% | StringString Matching |
| Not Boring Movies | Easy | 75.1% | 24.9% | Database |
| Find Closest Number to Zero | Easy | 47.7% | 24.9% | Array |
| Add to Array-Form of Integer | Easy | 45.4% | 24.9% | ArrayMath |
| Find K-th Smallest Pair Distance | Hard | 46.3% | 24.9% | ArrayTwo PointersBinary Search+1 |
| Rank Transform of an Array | Easy | 70.8% | 24.9% | ArrayHash TableSorting |
| Rabbits in Forest | Medium | 58.1% | 24.9% | ArrayHash TableMath+1 |
| Check If N and Its Double Exist | Easy | 41.7% | 24.9% | ArrayHash TableTwo Pointers+2 |
| Clear Digits | Easy | 82.7% | 24.9% | StringStackSimulation |
| Find the Punishment Number of an Integer | Medium | 81.7% | 24.9% | MathBacktracking |
| House Robber IV | Medium | 64.8% | 24.9% | ArrayBinary SearchDynamic Programming+1 |
| Unique Length-3 Palindromic Subsequences | Medium | 73.8% | 24.9% | Hash TableStringBit Manipulation+1 |
| Check if All Characters Have Equal Number of Occurrences | Easy | 79.4% | 24.9% | Hash TableStringCounting |
| Count the Number of Arrays with K Matching Adjacent Elements | Hard | 58.4% | 24.9% | MathCombinatorics |
| Best Sightseeing Pair | Medium | 62.7% | 24.9% | ArrayDynamic Programming |
| Kth Smallest Product of Two Sorted Arrays | Hard | 48.9% | 24.9% | ArrayBinary Search |
| Valid Word | Easy | 50.9% | 24.9% | String |
| Binary Tree Preorder Traversal | Easy | 75.2% | 24.9% | StackTreeDepth-First Search+1 |
| Valid Perfect Square | Easy | 44.7% | 24.9% | MathBinary Search |
| Task Scheduler | Medium | 62.7% | 24.9% | ArrayHash TableGreedy+3 |
| Kids With the Greatest Number of Candies | Easy | 88.0% | 24.9% | Array |
| Number of Subsequences That Satisfy the Given Sum Condition | Medium | 49.3% | 24.9% | ArrayTwo PointersBinary Search+1 |
| Most Stones Removed with Same Row or Column | Medium | 62.7% | 24.9% | Hash TableDepth-First SearchUnion-Find+1 |
| Create a DataFrame from List | Easy | 81.1% | 24.9% | |
| Reverse Bits | Easy | 67.8% | 24.9% | Divide and ConquerBit Manipulation |
| Employees Whose Manager Left the Company | Easy | 48.6% | 24.9% | Database |
| Array Prototype Last | Easy | 74.6% | 24.9% | |
| Couples Holding Hands | Hard | 59.2% | 24.9% | GreedyDepth-First SearchBreadth-First Search+2 |
| Minimum Limit of Balls in a Bag | Medium | 66.5% | 24.9% | ArrayBinary Search |
| Defuse the Bomb | Easy | 79.3% | 24.9% | ArraySliding Window |
| Two Sum IV - Input is a BST | Easy | 63.0% | 24.9% | Hash TableTwo PointersTree+4 |
| Maximum Number of Events That Can Be Attended | Medium | 38.9% | 24.9% | ArrayGreedySorting+1 |
| Find Winner on a Tic Tac Toe Game | Easy | 54.5% | 24.9% | ArrayHash TableMatrix+1 |
| User Activity for the Past 30 Days I | Easy | 50.5% | 24.9% | Database |
| Coin Change II | Medium | 60.4% | 24.9% | ArrayDynamic Programming |
| Next Greater Numerically Balanced Number | Medium | 63.0% | 24.9% | Hash TableMathBacktracking+2 |
| Bus Routes | Hard | 47.1% | 24.9% | ArrayHash TableBreadth-First Search |
| Furthest Point From Origin | Easy | 65.3% | 21.7% | StringCounting |
| Find the Prefix Common Array of Two Arrays | Medium | 87.0% | 21.7% | ArrayHash TableBit Manipulation |
| Robot Return to Origin | Easy | 76.5% | 21.7% | StringSimulation |
| Sum Root to Leaf Numbers | Medium | 69.6% | 21.7% | TreeDepth-First SearchBinary Tree |
| Divide an Array Into Subarrays With Minimum Cost I | Easy | 80.5% | 21.7% | ArraySortingEnumeration |
| IPO | Hard | 53.3% | 21.7% | ArrayGreedySorting+1 |
| Customers Who Bought All Products | Medium | 63.7% | 21.7% | Database |
| Best Time to Buy and Sell Stock with Cooldown | Medium | 61.7% | 21.7% | ArrayDynamic Programming |
| Delete Nodes From Linked List Present in Array | Medium | 69.5% | 21.7% | ArrayHash TableLinked List |
| Number of Enclaves | Medium | 71.5% | 21.7% | ArrayDepth-First SearchBreadth-First Search+2 |
| Next Greater Node In Linked List | Medium | 63.9% | 21.7% | ArrayLinked ListStack+1 |
| Department Top Three Salaries | Hard | 59.9% | 21.7% | Database |
| Subtree of Another Tree | Easy | 51.3% | 21.7% | TreeDepth-First SearchString Matching+2 |
| Minimum Cost to Cut a Stick | Hard | 62.8% | 21.7% | ArrayDynamic ProgrammingSorting |
| Relative Ranks | Easy | 74.4% | 21.7% | ArraySortingHeap (Priority Queue) |
| Maximum Points You Can Obtain from Cards | Medium | 57.3% | 21.7% | ArraySliding WindowPrefix Sum |
| K Closest Points to Origin | Medium | 68.8% | 21.7% | ArrayMathDivide and Conquer+4 |
| Convert a Number to Hexadecimal | Easy | 53.3% | 21.7% | MathStringBit Manipulation |
| Design Add and Search Words Data Structure | Medium | 48.2% | 21.7% | StringDepth-First SearchDesign+1 |
| Intersection of Two Arrays II | Easy | 59.7% | 21.7% | ArrayHash TableTwo Pointers+2 |
| Find Largest Value in Each Tree Row | Medium | 66.3% | 21.7% | TreeDepth-First SearchBreadth-First Search+1 |
| Min Cost Climbing Stairs | Easy | 68.0% | 21.7% | ArrayDynamic Programming |
| Car Fleet | Medium | 54.8% | 21.7% | ArrayStackSorting+1 |
| Transpose Matrix | Easy | 75.9% | 21.7% | ArrayMatrixSimulation |
| Snakes and Ladders | Medium | 48.0% | 21.7% | ArrayBreadth-First SearchMatrix |
| Count Negative Numbers in a Sorted Matrix | Easy | 79.5% | 21.7% | ArrayBinary SearchMatrix |
| Find the Maximum Achievable Number | Easy | 91.2% | 21.7% | Math |
| Sum of Subarray Ranges | Medium | 60.8% | 21.7% | ArrayStackMonotonic Stack |
| Shortest Subarray to be Removed to Make Array Sorted | Medium | 51.3% | 21.7% | ArrayTwo PointersBinary Search+2 |
| Maximum Candies Allocated to K Children | Medium | 49.9% | 21.7% | ArrayBinary Search |
| Minimum Number of Operations to Move All Balls to Each Box | Medium | 90.1% | 21.7% | ArrayStringPrefix Sum |
| Find N Unique Integers Sum up to Zero | Easy | 78.5% | 21.7% | ArrayMath |
| Count Symmetric Integers | Easy | 83.1% | 21.7% | MathEnumeration |
| Count the Hidden Sequences | Medium | 56.7% | 21.7% | ArrayPrefix Sum |
| Push Dominoes | Medium | 63.0% | 21.7% | Two PointersStringDynamic Programming |
| Count the Number of Fair Pairs | Medium | 52.7% | 21.7% | ArrayTwo PointersBinary Search+1 |
| Maximum Subarray Sum With Length Divisible by K | Medium | 49.6% | 21.7% | ArrayHash TablePrefix Sum |
| Zero Array Transformation I | Medium | 54.4% | 21.7% | ArrayPrefix Sum |
| Find the K-th Character in String Game I | Easy | 81.6% | 21.7% | MathBit ManipulationRecursion+1 |
| Sum of Beauty of All Substrings | Medium | 73.6% | 21.7% | Hash TableStringCounting |
| Longest Nice Subarray | Medium | 64.8% | 21.7% | ArrayBit ManipulationSliding Window |
| Backspace String Compare | Easy | 49.8% | 21.7% | Two PointersStringStack+1 |
| Longest Binary Subsequence Less Than or Equal to K | Medium | 52.8% | 21.7% | StringDynamic ProgrammingGreedy+1 |
| Minimum Number of Refueling Stops | Hard | 41.1% | 21.7% | ArrayDynamic ProgrammingGreedy+1 |
| Find a Peak Element II | Medium | 54.4% | 21.7% | ArrayBinary SearchMatrix |
| Bitwise ORs of Subarrays | Medium | 56.8% | 21.7% | ArrayDynamic ProgrammingBit Manipulation |
| The k-th Lexicographical String of All Happy Strings of Length n | Medium | 85.3% | 21.7% | StringBacktracking |
| Valid Number | Hard | 22.6% | 21.7% | String |
| Number of Matching Subsequences | Medium | 50.6% | 21.7% | ArrayHash TableString+4 |
| Type of Triangle | Easy | 44.1% | 21.7% | ArrayMathSorting |
| Longest Palindromic Subsequence | Medium | 65.1% | 21.7% | StringDynamic Programming |
| Count Submatrices With All Ones | Medium | 71.1% | 21.7% | ArrayDynamic ProgrammingStack+2 |
| Find All K-Distant Indices in an Array | Easy | 77.4% | 21.7% | ArrayTwo Pointers |
| Ways to Express an Integer as Sum of Powers | Medium | 49.9% | 21.7% | Dynamic Programming |
| Largest Triangle Area | Easy | 71.5% | 21.7% | ArrayMathGeometry |
| Range Sum Query 2D - Mutable | Medium | 45.4% | 21.7% | ArrayDesignBinary Indexed Tree+2 |
| Convert Sorted Array to Binary Search Tree | Easy | 75.2% | 21.7% | ArrayDivide and ConquerTree+2 |
| Binary Tree Postorder Traversal | Easy | 77.6% | 21.7% | StackTreeDepth-First Search+1 |
| Count Complete Tree Nodes | Easy | 72.1% | 21.7% | Binary SearchBit ManipulationTree+1 |
| Integer to English Words | Hard | 34.8% | 21.7% | MathStringRecursion |
| Counting Bits | Easy | 80.4% | 21.7% | Dynamic ProgrammingBit Manipulation |
| Minimum Time Difference | Medium | 62.6% | 21.7% | ArrayMathString+1 |
| Count Number of Nice Subarrays | Medium | 74.8% | 21.7% | ArrayHash TableMath+2 |
| Find the Smallest Divisor Given a Threshold | Medium | 65.5% | 21.7% | ArrayBinary Search |
| Max Number of K-Sum Pairs | Medium | 56.9% | 21.7% | ArrayHash TableTwo Pointers+1 |
| Find the Highest Altitude | Easy | 83.9% | 21.7% | ArrayPrefix Sum |
| Smallest Range Covering Elements from K Lists | Hard | 70.1% | 21.7% | ArrayHash TableGreedy+3 |
| Invalid Tweets | Easy | 85.2% | 21.7% | Database |
| Game Play Analysis IV | Medium | 40.8% | 21.7% | Database |
| Triangle Judgement | Easy | 74.5% | 21.7% | Database |
| Longest Harmonious Subsequence | Easy | 64.4% | 21.7% | ArrayHash TableSliding Window+2 |
| Detect Capital | Easy | 56.5% | 21.7% | String |
| Car Pooling | Medium | 56.2% | 21.7% | ArraySortingHeap (Priority Queue)+2 |
| Minimum Cost For Tickets | Medium | 67.4% | 21.7% | ArrayDynamic Programming |
| Find Subsequence of Length K With the Largest Sum | Easy | 57.4% | 21.7% | ArrayHash TableSorting+1 |
| All Nodes Distance K in Binary Tree | Medium | 67.4% | 21.7% | Hash TableTreeDepth-First Search+2 |
| Expression Add Operators | Hard | 42.8% | 21.7% | MathStringBacktracking |
| Find the Minimum Area to Cover All Ones I | Medium | 78.2% | 21.7% | ArrayMatrix |
| Minimum Cost to Move Chips to The Same Position | Easy | 72.8% | 21.7% | ArrayMathGreedy |
| Find Root of N-Ary Tree | Medium | 78.6% | 21.7% | Hash TableBit ManipulationTree+1 |
| Filter Elements from Array | Easy | 85.6% | 21.7% | |
| Consecutive Characters | Easy | 60.3% | 21.7% | String |
| Minimum Time Visiting All Points | Easy | 84.8% | 21.7% | ArrayMathGeometry |
| Longest Balanced Subarray I | Medium | 65.7% | 21.7% | ArrayHash TableDivide and Conquer+2 |
| Baseball Game | Easy | 80.1% | 21.7% | ArrayStackSimulation |
| Total Waviness of Numbers in Range II | Hard | | 18.0% | MathDynamic Programming |
| Create Binary Tree From Descriptions | Medium | 81.7% | 18.0% | ArrayHash TableTree+1 |
| Jump Game VII | Medium | 26.4% | 18.0% | StringDynamic ProgrammingSliding Window+1 |
| Search Suggestions System | Medium | 65.1% | 18.0% | ArrayStringBinary Search+3 |
| Find the Length of the Longest Common Prefix | Medium | 57.0% | 18.0% | ArrayHash TableString+1 |
| Maximum Building Height | Hard | 38.3% | 18.0% | ArrayMathSorting |
| Number of Longest Increasing Subsequence | Medium | 51.4% | 18.0% | ArrayDynamic ProgrammingBinary Indexed Tree+1 |
| Magic Squares In Grid | Medium | 55.1% | 18.0% | ArrayHash TableMath+1 |
| Minimum Operations to Convert All Elements to Zero | Medium | 53.0% | 18.0% | ArrayHash TableStack+2 |
| Balance a Binary Search Tree | Medium | 86.3% | 18.0% | Divide and ConquerGreedyTree+3 |
| Minimum Swaps to Arrange a Binary Grid | Medium | | 18.0% | ArrayGreedyMatrix |
| Last Stone Weight | Easy | 66.3% | 18.0% | ArrayHeap (Priority Queue) |
| Rotate Function | Medium | 45.4% | 18.0% | ArrayMathDynamic Programming |
| K-diff Pairs in an Array | Medium | 45.6% | 18.0% | ArrayHash TableTwo Pointers+2 |
| Distribute Candies | Easy | 70.8% | 18.0% | ArrayHash Table |
| Pascal's Triangle II | Easy | 67.1% | 18.0% | ArrayDynamic Programming |
| Number of 1 Bits | Easy | 76.4% | 18.0% | Divide and ConquerBit Manipulation |
| Range Sum Query 2D - Immutable | Medium | 57.9% | 18.0% | ArrayDesignMatrix+1 |
| Integer Break | Medium | 61.9% | 18.0% | MathDynamic Programming |
| All O`one Data Structure | Hard | 44.2% | 18.0% | Hash TableLinked ListDesign+1 |
| Find Smallest Letter Greater Than Target | Easy | 58.9% | 18.0% | ArrayBinary Search |
| Spiral Matrix III | Medium | 84.5% | 18.0% | ArrayMatrixSimulation |
| Find Common Characters | Easy | 74.7% | 18.0% | ArrayHash TableString |
| Project Employees I | Easy | 66.5% | 18.0% | Database |
| N-th Tribonacci Number | Easy | 63.3% | 18.0% | MathDynamic ProgrammingMemoization |
| Special Array With X Elements Greater Than or Equal X | Easy | 66.8% | 18.0% | ArrayBinary SearchSorting |
| Delete the Middle Node of a Linked List | Medium | 59.5% | 18.0% | Linked ListTwo Pointers |
| Left and Right Sum Differences | Easy | 87.9% | 18.0% | ArrayPrefix Sum |
| Find Bottom Left Tree Value | Medium | 72.2% | 18.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Guess the Word | Hard | 36.9% | 18.0% | ArrayMathString+2 |
| Minimum Genetic Mutation | Medium | 56.4% | 18.0% | Hash TableStringBreadth-First Search |
| Partition Labels | Medium | 81.8% | 18.0% | Hash TableTwo PointersString+1 |
| Meeting Rooms | Easy | 59.3% | 18.0% | ArraySorting |
| Count Servers that Communicate | Medium | 73.5% | 18.0% | ArrayDepth-First SearchBreadth-First Search+3 |
| Final Value of Variable After Performing Operations | Easy | 90.6% | 18.0% | ArrayStringSimulation |
| Range Sum of Sorted Subarray Sums | Medium | 63.1% | 18.0% | ArrayTwo PointersBinary Search+2 |
| Find the Longest Substring Containing Vowels in Even Counts | Medium | 75.7% | 18.0% | Hash TableStringBit Manipulation+1 |
| Strange Printer | Hard | 60.9% | 18.0% | StringDynamic Programming |
| Excel Sheet Column Number | Easy | 67.3% | 18.0% | MathString |
| Trapping Rain Water II | Hard | 64.0% | 18.0% | ArrayBreadth-First SearchHeap (Priority Queue)+1 |
| Check if Number is a Sum of Powers of Three | Medium | 79.4% | 18.0% | Math |
| Maximum Length of Repeated Subarray | Medium | 51.3% | 18.0% | ArrayBinary SearchDynamic Programming+3 |
| Number of Ways to Arrive at Destination | Medium | 37.3% | 18.0% | Dynamic ProgrammingGraph TheoryTopological Sort+1 |
| Zero Array Transformation II | Medium | 43.6% | 18.0% | ArrayTwo PointersBinary Search+1 |
| Continuous Subarrays | Medium | 57.9% | 18.0% | ArrayQueueSliding Window+3 |
| Divide Array Into Equal Pairs | Easy | 79.2% | 18.0% | ArrayHash TableBit Manipulation+1 |
| Max Chunks To Make Sorted | Medium | 64.1% | 18.0% | ArrayStackGreedy+2 |
| Count Subarrays Where Max Element Appears at Least K Times | Medium | 62.4% | 18.0% | ArraySliding Window |
| Product Sales Analysis I | Easy | 85.6% | 18.0% | Database |
| Game of Life | Medium | 72.4% | 18.0% | ArrayMatrixSimulation |
| Maximum Sum of 3 Non-Overlapping Subarrays | Hard | 59.7% | 18.0% | ArrayDynamic ProgrammingSliding Window+1 |
| Minimum Number of Operations to Make Elements in Array Distinct | Easy | 71.3% | 18.0% | ArrayHash Table |
| Remove Zero Sum Consecutive Nodes from Linked List | Medium | 53.1% | 18.0% | Hash TableLinked List |
| Shortest Distance from All Buildings | Hard | 44.9% | 18.0% | ArrayBreadth-First SearchMatrix |
| Maximum Value of an Ordered Triplet II | Medium | 56.4% | 18.0% | Array |
| Open the Lock | Medium | 61.2% | 18.0% | ArrayHash TableString+1 |
| Count Hills and Valleys in an Array | Easy | 69.1% | 18.0% | Array |
| Find the Number of Distinct Colors Among the Balls | Medium | 54.2% | 18.0% | ArrayHash TableSimulation |
| Count Salary Categories | Medium | 64.0% | 18.0% | Database |
| Path With Minimum Effort | Medium | 62.8% | 18.0% | ArrayBinary SearchDepth-First Search+4 |
| Largest 3-Same-Digit Number in String | Easy | 72.7% | 18.0% | String |
| Apply Operations to an Array | Easy | 74.7% | 18.0% | ArrayTwo PointersSimulation |
| Minimum Operations to Make the Integer Zero | Medium | 58.2% | 18.0% | Bit ManipulationBrainteaserEnumeration |
| Row With Maximum Ones | Easy | 74.3% | 18.0% | ArrayMatrix |
| Check if Grid can be Cut into Sections | Medium | 68.3% | 18.0% | ArraySorting |
| Zero Array Transformation III | Medium | 54.9% | 18.0% | ArrayTwo PointersGreedy+3 |
| Count Elements With Maximum Frequency | Easy | 79.8% | 18.0% | ArrayHash TableCounting |
| Ones and Zeroes | Medium | 53.1% | 18.0% | ArrayStringDynamic Programming |
| Biggest Single Number | Easy | 70.9% | 18.0% | Database |
| Find the Maximum Length of Valid Subsequence II | Medium | 57.2% | 18.0% | ArrayDynamic Programming |
| Count Special Triplets | Medium | 47.1% | 18.0% | ArrayHash TableCounting |
| Smallest Subarrays With Maximum Bitwise OR | Medium | 62.0% | 18.0% | ArrayBinary SearchBit Manipulation+1 |
| Binary Tree Cameras | Hard | 47.6% | 18.0% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Maximum Number of Events That Can Be Attended II | Hard | 63.6% | 18.0% | ArrayBinary SearchDynamic Programming+1 |
| Maximum Product of Splitted Binary Tree | Medium | 55.5% | 18.0% | TreeDepth-First SearchBinary Tree |
| New 21 Game | Medium | 52.0% | 18.0% | MathDynamic ProgrammingSliding Window+1 |
| Sum of Mutated Array Closest to Target | Medium | 46.2% | 18.0% | ArrayBinary SearchSorting |
| Find Users With Valid E-Mails | Easy | 36.7% | 18.0% | Database |
| Vowel Spellchecker | Medium | 61.4% | 18.0% | ArrayHash TableString |
| Find the Minimum Amount of Time to Brew Potions | Medium | 62.7% | 18.0% | ArraySimulationPrefix Sum |
| Number of People Aware of a Secret | Medium | 60.9% | 18.0% | Dynamic ProgrammingQueueSimulation |
| Design Task Manager | Medium | 49.1% | 18.0% | Hash TableDesignHeap (Priority Queue)+1 |
| Taking Maximum Energy From the Mystic Dungeon | Medium | 61.0% | 18.0% | ArrayDynamic ProgrammingPrefix Sum |
| Max Points on a Line | Hard | 30.3% | 18.0% | ArrayHash TableMath+1 |
| Burst Balloons | Hard | 63.0% | 18.0% | ArrayDynamic Programming |
| Minimum Number of Arrows to Burst Balloons | Medium | 61.2% | 18.0% | ArrayGreedySorting |
| Delete and Earn | Medium | 57.1% | 18.0% | ArrayHash TableDynamic Programming |
| Network Delay Time | Medium | 59.8% | 18.0% | Depth-First SearchBreadth-First SearchGraph Theory+2 |
| Find the Town Judge | Easy | 50.5% | 18.0% | ArrayHash TableGraph Theory |
| Construct Binary Search Tree from Preorder Traversal | Medium | 84.1% | 18.0% | ArrayStackTree+3 |
| Partition Array for Maximum Sum | Medium | 77.3% | 18.0% | ArrayDynamic Programming |
| Longest String Chain | Medium | 62.8% | 18.0% | ArrayHash TableTwo Pointers+3 |
| Minimum Deletions to Make String Balanced | Medium | 68.2% | 18.0% | StringDynamic ProgrammingStack |
| Richest Customer Wealth | Easy | 88.7% | 18.0% | ArrayMatrix |
| Maximum Twin Sum of a Linked List | Medium | 81.6% | 18.0% | Linked ListTwo PointersStack |
| To Be Or Not To Be | Easy | 63.3% | 18.0% | |
| Return Length of Arguments Passed | Easy | 94.5% | 18.0% | |
| Hand of Straights | Medium | 57.8% | 18.0% | ArrayHash TableGreedy+1 |
| Create Maximum Number | Hard | 34.7% | 18.0% | ArrayTwo PointersStack+2 |
| Add Strings | Easy | 52.1% | 18.0% | MathStringSimulation |
| Design a Todo List | Medium | 59.8% | 18.0% | ArrayHash TableString+2 |
| Find Common Elements Between Two Arrays | Easy | 84.4% | 18.0% | ArrayHash Table |
| Combination Sum III | Medium | 73.0% | 18.0% | ArrayBacktracking |
| Swap Sex of Employees | Easy | 84.5% | 18.0% | Database |
| Minimum Bit Flips to Convert Number | Easy | 87.8% | 18.0% | Bit Manipulation |
| Maximum Number of Vowels in a Substring of Given Length | Medium | 61.6% | 18.0% | StringSliding Window |
| Minimum Total Distance Traveled | Hard | 58.8% | 18.0% | ArrayDynamic ProgrammingSorting |
| Sales Person | Easy | 65.8% | 18.0% | Database |
| Maximum Score Words Formed by Letters | Hard | 81.5% | 18.0% | ArrayHash TableString+5 |
| String Matching in an Array | Easy | 69.8% | 18.0% | ArrayStringString Matching |
| Maximum Population Year | Easy | 63.7% | 18.0% | ArrayCountingPrefix Sum |
| Maximum Manhattan Distance After K Changes | Medium | 54.2% | 18.0% | Hash TableMathString+1 |
| Maximum XOR of Two Numbers in an Array | Medium | 53.4% | 18.0% | ArrayHash TableBit Manipulation+1 |
| Power of Four | Easy | 51.8% | 18.0% | MathBit ManipulationRecursion |
| Successful Pairs of Spells and Potions | Medium | 49.5% | 18.0% | ArrayTwo PointersBinary Search+1 |
| Make The String Great | Easy | 68.4% | 18.0% | StringStack |
| Count the Number of Consistent Strings | Easy | 88.5% | 18.0% | ArrayHash TableString+2 |
| Random Pick with Weight | Medium | 48.9% | 18.0% | ArrayMathBinary Search+2 |
| Binary Watch | Easy | 65.2% | 18.0% | BacktrackingBit Manipulation |
| Restore IP Addresses | Medium | 55.3% | 18.0% | StringBacktracking |
| Investments in 2016 | Medium | 50.8% | 18.0% | Database |
| Minimum Pair Removal to Sort Array I | Easy | 65.3% | 18.0% | ArrayHash TableLinked List+4 |
| Contains Duplicate III | Hard | 24.5% | 18.0% | ArraySliding WindowSorting+2 |
| Rank Teams by Votes | Medium | 60.0% | 18.0% | ArrayHash TableString+2 |
| Design Linked List | Medium | 29.9% | 18.0% | Linked ListDesign |
| Four Divisors | Medium | 56.6% | 18.0% | ArrayMath |
| Number of Ways to Paint N × 3 Grid | Hard | 80.5% | 18.0% | Dynamic Programming |
| Number of Ways to Assign Edge Weights II | Hard | | 13.6% | ArrayMathDynamic Programming+3 |
| Process String with Special Operations I | Medium | 65.0% | 13.6% | StringSimulation |
| Minimum Cost of Buying Candies With Discount | Easy | 62.7% | 13.6% | ArrayGreedySorting |
| Earliest Finish Time for Land and Water Rides I | Easy | | 13.6% | ArrayTwo PointersBinary Search+2 |
| Closest Equal Element Queries | Medium | 32.8% | 13.6% | ArrayHash TableBinary Search |
| Valid Mountain Array | Easy | 35.0% | 13.6% | Array |
| Guess Number Higher or Lower II | Medium | 52.5% | 13.6% | MathDynamic ProgrammingGame Theory |
| Bulls and Cows | Medium | 52.2% | 13.6% | Hash TableStringCounting |
| Number of ZigZag Arrays II | Hard | | 13.6% | MathDynamic Programming |
| Champagne Tower | Medium | 64.1% | 13.6% | Dynamic Programming |
| Two Furthest Houses With Different Colors | Easy | 65.5% | 13.6% | ArrayGreedy |
| Words Within Two Edits of Dictionary | Medium | 61.8% | 13.6% | ArrayStringTrie |
| Wiggle Sort II | Medium | 37.0% | 13.6% | ArrayDivide and ConquerGreedy+2 |
| Find the Largest Area of Square Inside Two Rectangles | Medium | 66.9% | 13.6% | ArrayMathGeometry |
| Concatenation of Consecutive Binary Numbers | Medium | 66.0% | 13.6% | MathBit ManipulationSimulation |
| Longest Balanced Substring II | Medium | 42.0% | 13.6% | Hash TableStringPrefix Sum |
| Largest Submatrix With Rearrangements | Medium | 75.2% | 13.6% | ArrayGreedySorting+1 |
| Flipping an Image | Easy | 83.6% | 13.6% | ArrayTwo PointersBit Manipulation+2 |
| Spiral Matrix II | Medium | 74.7% | 13.6% | ArrayMatrixSimulation |
| N-Repeated Element in Size 2N Array | Easy | 79.8% | 13.6% | ArrayHash Table |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 13.6% | ArrayDynamic ProgrammingDepth-First Search+5 |
| Flatten Nested List Iterator | Medium | 65.6% | 13.6% | StackTreeDepth-First Search+3 |
| Total Cost to Hire K Workers | Medium | 43.5% | 13.6% | ArrayTwo PointersHeap (Priority Queue)+1 |
| Convert Sorted List to Binary Search Tree | Medium | 66.0% | 13.6% | Linked ListDivide and ConquerTree+2 |
| Binary Tree Paths | Easy | 68.2% | 13.6% | StringBacktrackingTree+2 |
| Design Twitter | Medium | 44.2% | 13.6% | Hash TableLinked ListDesign+1 |
| Sum of Left Leaves | Easy | 62.4% | 13.6% | TreeDepth-First SearchBreadth-First Search+1 |
| Predict the Winner | Medium | 56.1% | 13.6% | ArrayMathDynamic Programming+2 |
| 2 Keys Keyboard | Medium | 59.3% | 13.6% | MathDynamic Programming |
| Find Duplicate Subtrees | Medium | 60.6% | 13.6% | Hash TableTreeDepth-First Search+1 |
| Kth Largest Element in a Stream | Easy | 60.7% | 13.6% | TreeDesignBinary Search Tree+3 |
| Knight Dialer | Medium | 61.7% | 13.6% | Dynamic Programming |
| Reveal Cards In Increasing Order | Medium | 83.5% | 13.6% | ArrayQueueSorting+1 |
| Unique Paths III | Hard | 82.8% | 13.6% | ArrayBacktrackingBit Manipulation+1 |
| Interval List Intersections | Medium | 72.9% | 13.6% | ArrayTwo PointersSweep Line |
| Relative Sort Array | Easy | 75.1% | 13.6% | ArrayHash TableSorting+1 |
| Minimum Cost Tree From Leaf Values | Medium | 67.8% | 13.6% | ArrayDynamic ProgrammingStack+2 |
| Three Consecutive Odds | Easy | 69.3% | 13.6% | Array |
| Maximum Score From Removing Substrings | Medium | 66.6% | 13.6% | StringStackGreedy |
| Amount of Time for Binary Tree to Be Infected | Medium | 65.1% | 13.6% | Hash TableTreeDepth-First Search+2 |
| Create Target Array in the Given Order | Easy | 86.5% | 13.6% | ArraySimulation |
| Gray Code | Medium | 64.1% | 13.6% | MathBacktrackingBit Manipulation |
| Path Sum III | Medium | 46.3% | 13.6% | TreeDepth-First SearchBinary Tree |
| Custom Sort String | Medium | 72.3% | 13.6% | Hash TableStringSorting |
| Find the Power of K-Size Subarrays I | Medium | 62.1% | 13.6% | ArraySliding Window |
| Fix Names in a Table | Easy | 60.6% | 13.6% | Database |
| Search in a Binary Search Tree | Easy | 82.5% | 13.6% | TreeBinary Search TreeBinary Tree |
| Minimum Number of Swaps to Make the String Balanced | Medium | 78.1% | 13.6% | Two PointersStringStack+1 |
| Count Good Triplets | Easy | 85.5% | 13.6% | ArrayEnumeration |
| Minimum Array End | Medium | 55.5% | 13.6% | Bit Manipulation |
| Monotonic Array | Easy | 62.2% | 13.6% | Array |
| Longest Subarray With Maximum Bitwise AND | Medium | 65.4% | 13.6% | ArrayBit ManipulationBrainteaser |
| Repeated String Match | Medium | 38.4% | 13.6% | StringString Matching |
| Make Array Elements Equal to Zero | Easy | 68.3% | 13.6% | ArraySimulationPrefix Sum |
| Divisor Game | Easy | 71.6% | 13.6% | MathDynamic ProgrammingBrainteaser+1 |
| The Number of the Smallest Unoccupied Chair | Medium | 60.4% | 13.6% | ArrayHash TableHeap (Priority Queue) |
| Minimum Length of String After Operations | Medium | 75.0% | 13.6% | Hash TableStringCounting |
| Minimum Number of Changes to Make Binary String Beautiful | Medium | 76.4% | 13.6% | String |
| Maximum Distance in Arrays | Medium | 45.6% | 13.6% | ArrayGreedy |
| Minimum Number of Days to Disconnect Island | Hard | 58.8% | 13.6% | ArrayDepth-First SearchBreadth-First Search+2 |
| N-ary Tree Postorder Traversal | Easy | 81.0% | 13.6% | StackTreeDepth-First Search |
| DI String Match | Easy | 80.9% | 13.6% | ArrayTwo PointersString+1 |
| Count Vowel Substrings of a String | Easy | 72.9% | 13.6% | Hash TableString |
| Longest Nice Substring | Easy | 63.8% | 13.6% | Hash TableStringDivide and Conquer+2 |
| Sales Analysis III | Easy | 47.3% | 13.6% | Database |
| Minimum Index Sum of Two Lists | Easy | 59.5% | 13.6% | ArrayHash TableString |
| Number of Ways to Split Array | Medium | 55.9% | 13.6% | ArrayPrefix Sum |
| Minimum Operations to Make Array Values Equal to K | Easy | 73.3% | 13.6% | ArrayHash Table |
| Parsing A Boolean Expression | Hard | 69.8% | 13.6% | StringStackRecursion |
| Delete Characters to Make Fancy String | Easy | 74.1% | 13.6% | String |
| Moving Average from Data Stream | Easy | 80.2% | 13.6% | ArrayDesignQueue+1 |
| Minimum Number of Removals to Make Mountain Array | Hard | 54.8% | 13.6% | ArrayBinary SearchDynamic Programming+1 |
| Find Score of an Array After Marking All Elements | Medium | 64.5% | 13.6% | ArrayHash TableSorting+2 |
| Minimum Height Trees | Medium | 42.4% | 13.6% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Painting a Grid With Three Different Colors | Hard | 77.3% | 13.6% | Dynamic Programming |
| Sort the People | Easy | 84.8% | 13.6% | ArrayHash TableString+1 |
| Length of Longest Fibonacci Subsequence | Medium | 57.5% | 13.6% | ArrayHash TableDynamic Programming |
| Smallest Even Multiple | Easy | 88.3% | 13.6% | MathNumber Theory |
| Maximum Average Pass Ratio | Medium | 74.1% | 13.6% | ArrayGreedyHeap (Priority Queue) |
| K-th Symbol in Grammar | Medium | 48.1% | 13.6% | MathBit ManipulationRecursion |
| Reverse Prefix of Word | Easy | 86.5% | 13.6% | Two PointersStringStack |
| Remove Digit From Number to Maximize Result | Easy | 48.2% | 13.6% | StringGreedyEnumeration |
| Pacific Atlantic Water Flow | Medium | 60.6% | 13.6% | ArrayDepth-First SearchBreadth-First Search+1 |
| Minimum Operations to Make Binary Array Elements Equal to One I | Medium | 80.4% | 13.6% | ArrayBit ManipulationQueue+2 |
| Find Center of Star Graph | Easy | 86.6% | 13.6% | Graph Theory |
| Count Beautiful Splits in an Array | Medium | 18.6% | 13.6% | ArrayDynamic Programming |
| Find Greatest Common Divisor of Array | Easy | 79.7% | 13.6% | ArrayMathNumber Theory |
| Counting Words With a Given Prefix | Easy | 84.5% | 13.6% | ArrayStringString Matching |
| Find the Original Typed String I | Easy | 72.1% | 13.6% | String |
| Construct K Palindrome Strings | Medium | 68.6% | 13.6% | Hash TableStringGreedy+1 |
| Find the Middle Index in Array | Easy | 69.2% | 13.6% | ArrayPrefix Sum |
| Divide a String Into Groups of Size k | Easy | 77.1% | 13.6% | StringSimulation |
| Find Followers Count | Easy | 69.5% | 13.6% | Database |
| Count Prefix and Suffix Pairs I | Easy | 77.8% | 13.6% | ArrayStringTrie+3 |
| Game Play Analysis I | Easy | 76.2% | 13.6% | Database |
| Minimum Deletions to Make String K-Special | Medium | 67.2% | 13.6% | Hash TableStringGreedy+2 |
| Merge Two Binary Trees | Easy | 79.0% | 13.6% | TreeDepth-First SearchBreadth-First Search+1 |
| Maximum Erasure Value | Medium | 64.1% | 13.6% | ArrayHash TableSliding Window |
| Special Array I | Easy | 81.6% | 13.6% | Array |
| Count of Substrings Containing Every Vowel and K Consonants II | Medium | 40.6% | 13.6% | Hash TableStringSliding Window |
| Find the Maximum Number of Fruits Collected | Hard | 65.1% | 13.6% | ArrayDynamic ProgrammingMatrix |
| Dungeon Game | Hard | 40.9% | 13.6% | ArrayDynamic ProgrammingMatrix |
| Shortest Path in a Grid with Obstacles Elimination | Hard | 46.1% | 13.6% | ArrayBreadth-First SearchMatrix |
| Product of the Last K Numbers | Medium | 62.9% | 13.6% | ArrayMathDesign+2 |
| Recover a Tree From Preorder Traversal | Hard | 83.2% | 13.6% | StringTreeDepth-First Search+1 |
| Kth Largest Sum in a Binary Tree | Medium | 59.0% | 13.6% | TreeBreadth-First SearchSorting+1 |
| Maximum 69 Number | Easy | 84.5% | 13.6% | MathGreedy |
| Shortest Subarray with Sum at Least K | Hard | 32.6% | 13.6% | ArrayBinary SearchQueue+4 |
| Construct Binary Tree from Preorder and Postorder Traversal | Medium | 78.1% | 13.6% | ArrayHash TableDivide and Conquer+2 |
| Longest Subarray of 1's After Deleting One Element | Medium | 71.1% | 13.6% | ArrayDynamic ProgrammingSliding Window |
| Divisible and Non-divisible Sums Difference | Easy | 91.0% | 13.6% | Math |
| Closest Prime Numbers in Range | Medium | 51.7% | 13.6% | MathNumber Theory |
| Alternating Groups II | Medium | 59.9% | 13.6% | ArraySliding Window |
| Minimum Operations to Make Array Elements Zero | Hard | 60.4% | 13.6% | ArrayMathBit Manipulation |
| Maximum Sum Circular Subarray | Medium | 49.5% | 13.6% | ArrayDivide and ConquerDynamic Programming+2 |
| Separate Squares I | Medium | 58.0% | 13.6% | ArrayBinary Search |
| Largest Perimeter Triangle | Easy | 62.0% | 13.6% | ArrayMathGreedy+1 |
| Unique Binary Search Trees II | Medium | 62.0% | 13.6% | Dynamic ProgrammingBacktrackingTree+2 |
| Longest Palindrome by Concatenating Two Letter Words | Medium | 53.5% | 13.6% | ArrayHash TableString+2 |
| Insert into a Binary Search Tree | Medium | 73.4% | 13.6% | TreeBinary Search TreeBinary Tree |
| Verifying an Alien Dictionary | Easy | 55.9% | 13.6% | ArrayHash TableString |
| Most Frequent Even Element | Easy | 53.3% | 13.6% | ArrayHash TableCounting |
| Domino and Tromino Tiling | Medium | 51.4% | 13.6% | Dynamic Programming |
| Duplicate Zeros | Easy | 53.4% | 13.6% | ArrayTwo Pointers |
| Design HashSet | Easy | 67.8% | 13.6% | ArrayHash TableLinked List+2 |
| Sort By | Easy | 83.2% | 13.6% | |
| Final Prices With a Special Discount in a Shop | Easy | 84.0% | 13.6% | ArrayStackMonotonic Stack |
| Max Difference You Can Get From Changing an Integer | Medium | 48.8% | 13.6% | MathGreedy |
| Maximum Difference Between Increasing Elements | Easy | 66.5% | 13.6% | Array |
| Divide Array Into Arrays With Max Difference | Medium | 79.0% | 13.6% | ArrayGreedySorting |
| Reshape Data: Melt | Easy | 86.0% | 13.6% | |
| Maximum Unique Subarray Sum After Deletion | Easy | 40.5% | 13.6% | ArrayHash TableGreedy |
| Find Lucky Integer in an Array | Easy | 75.5% | 13.6% | ArrayHash TableCounting |
| Minimum Penalty for a Shop | Medium | 71.2% | 13.6% | StringPrefix Sum |
| Height Checker | Easy | 81.6% | 13.6% | ArraySortingCounting Sort |
| Reschedule Meetings for Maximum Free Time II | Medium | 60.4% | 13.6% | ArrayGreedyEnumeration |
| Fruits Into Baskets III | Medium | 38.9% | 13.6% | ArrayBinary SearchSegment Tree+1 |
| Remove K-Balanced Substrings | Medium | 32.4% | 13.6% | StringStackSimulation |
| Maximum Total Damage With Spell Casting | Medium | 45.0% | 13.6% | ArrayHash TableTwo Pointers+4 |
| Calculate Amount Paid in Taxes | Easy | 69.0% | 13.6% | ArraySimulation |
| 24 Game | Hard | 59.3% | 13.6% | ArrayMathBacktracking |
| Maximum Square Area by Removing Fences From a Field | Medium | 49.4% | 13.6% | ArrayHash TableEnumeration |
| Shortest Unsorted Continuous Subarray | Medium | 38.0% | 13.6% | ArrayTwo PointersStack+3 |
| Range Sum Query - Mutable | Medium | 42.6% | 13.6% | ArrayDivide and ConquerDesign+2 |
| Maximum Tastiness of Candy Basket | Medium | 67.9% | 13.6% | ArrayBinary SearchGreedy+1 |
| Hamming Distance | Easy | 76.6% | 13.6% | Bit Manipulation |
| Number of Steps to Reduce a Number to Zero | Easy | 85.7% | 13.6% | MathBit Manipulation |
| Word Search II | Hard | 38.1% | 13.6% | ArrayStringBacktracking+2 |
| LFU Cache | Hard | 48.6% | 13.6% | Hash TableLinked ListDesign+1 |
| Minimum Falling Path Sum | Medium | 60.8% | 13.6% | ArrayDynamic ProgrammingMatrix |
| Avoid Flood in The City | Medium | 39.0% | 13.6% | ArrayHash TableBinary Search+2 |
| Simple Bank System | Medium | 69.8% | 13.6% | ArrayHash TableDesign+1 |
| Fair Candy Swap | Easy | 64.6% | 13.6% | ArrayHash TableBinary Search+1 |
| Find X-Sum of All K-Long Subarrays I | Easy | 76.1% | 13.6% | ArrayHash TableSliding Window+1 |
| Maximum Frequency Stack | Hard | 66.6% | 13.6% | Hash TableStackDesign+1 |
| Brick Wall | Medium | 56.0% | 13.6% | ArrayHash Table |
| Minimum Score of a Path Between Two Cities | Medium | 58.6% | 13.6% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Construct Binary Tree from Inorder and Postorder Traversal | Medium | 68.1% | 13.6% | ArrayHash TableDivide and Conquer+2 |
| Percentage of Users Attended a Contest | Easy | 60.0% | 13.6% | Database |
| Longest Happy String | Medium | 65.5% | 13.6% | StringGreedyHeap (Priority Queue) |
| Find the Difference of Two Arrays | Easy | 81.3% | 13.6% | ArrayHash Table |
| My Calendar I | Medium | 58.2% | 13.6% | ArrayBinary SearchDesign+2 |
| Find Kth Bit in Nth Binary String | Medium | 70.2% | 13.6% | StringRecursionSimulation |
| Find Minimum Time to Reach Last Room I | Medium | 55.5% | 13.6% | ArrayGraph TheoryHeap (Priority Queue)+2 |
| Check if a Parentheses String Can Be Valid | Medium | 45.1% | 13.6% | StringStackGreedy |
| Longest Continuous Increasing Subsequence | Easy | 51.8% | 13.6% | Array |
| Maximum Absolute Sum of Any Subarray | Medium | 71.2% | 13.6% | ArrayDynamic Programming |
| Shortest Distance to a Character | Easy | 72.7% | 13.6% | ArrayTwo PointersString |
| Max Sum of Rectangle No Larger Than K | Hard | 45.3% | 13.6% | ArrayBinary SearchMatrix+2 |
| Find K Pairs with Smallest Sums | Medium | 41.6% | 13.6% | ArrayHeap (Priority Queue) |
| Maximum Repeating Substring | Easy | 41.1% | 13.6% | StringDynamic ProgrammingString Matching |
| Lowest Common Ancestor of Deepest Leaves | Medium | 79.4% | 13.6% | Hash TableTreeDepth-First Search+2 |
| Count Largest Group | Easy | 74.7% | 13.6% | Hash TableMathCounting |
| Finding Pairs With a Certain Sum | Medium | 61.6% | 13.6% | ArrayHash TableDesign |
| Find the Distance Value Between Two Arrays | Easy | 71.5% | 13.6% | ArrayTwo PointersBinary Search+1 |
| Number of Operations to Make Network Connected | Medium | 66.2% | 13.6% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Market Analysis I | Medium | 57.3% | 13.6% | Database |
| Nearest Exit from Entrance in Maze | Medium | 48.3% | 13.6% | ArrayBreadth-First SearchMatrix |
| Find the K-th Character in String Game II | Hard | 48.5% | 13.6% | MathBit ManipulationRecursion |
| Range Sum of BST | Easy | 87.6% | 13.6% | TreeDepth-First SearchBinary Search Tree+1 |
| Subtract the Product and Sum of Digits of an Integer | Easy | 86.6% | 13.6% | Math |
| Super Egg Drop | Hard | 29.9% | 13.6% | MathBinary SearchDynamic Programming |
| Exclusive Time of Functions | Medium | 66.1% | 13.6% | ArrayStack |
| Maximum Amount of Money Robot Can Earn | Medium | 29.5% | 13.6% | ArrayDynamic ProgrammingMatrix |
| Combination Sum IV | Medium | 55.0% | 13.6% | ArrayDynamic Programming |
| House Robber III | Medium | 55.6% | 13.6% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Smallest Subtree with all the Deepest Nodes | Medium | 77.5% | 13.6% | Hash TableTreeDepth-First Search+2 |
| Determine if Two Strings Are Close | Medium | 54.2% | 13.6% | Hash TableStringSorting+1 |
| Longest Balanced Substring I | Medium | 69.7% | 13.6% | Hash TableStringCounting+1 |
| Special Binary String | Hard | 79.3% | 13.6% | StringDivide and ConquerSorting |
| Take K of Each Character From Left and Right | Medium | 51.5% | 13.6% | Hash TableStringSliding Window |
| Longest Substring with At Least K Repeating Characters | Medium | 46.1% | 13.6% | Hash TableStringDivide and Conquer+1 |
| Online Election | Medium | 52.7% | 13.6% | ArrayHash TableBinary Search+1 |
| Number of Distinct Islands | Medium | 62.7% | 13.6% | ArrayHash TableDepth-First Search+5 |
| Nth Digit | Medium | 37.3% | 13.6% | MathBinary Search |
| Mirror Distance of an Integer | Easy | | 13.6% | Math |
| Map of Highest Peak | Medium | 75.7% | 13.6% | ArrayBreadth-First SearchMatrix |
| Maximum Matrix Sum | Medium | 67.6% | 13.6% | ArrayGreedyMatrix |
| Maximum Number of Balloons | Easy | 60.0% | 8.4% | Hash TableStringCounting |
| Minimize Hamming Distance After Swap Operations | Medium | 49.2% | 8.4% | ArrayDepth-First SearchUnion-Find |
| Employee Importance | Medium | 69.3% | 8.4% | ArrayHash TableTree+2 |
| Check Digitorial Permutation | Medium | | 8.4% | MathCounting |
| Fancy Sequence | Hard | 18.6% | 8.4% | MathDesignSegment Tree+1 |
| Alien Dictionary | Hard | 37.1% | 8.4% | ArrayStringDepth-First Search+3 |
| Minimum Distance to the Target Element | Easy | 54.2% | 8.4% | Array |
| Design Bounded Blocking Queue | Medium | 73.6% | 8.4% | Concurrency |
| Three Divisors | Easy | 63.9% | 8.4% | MathEnumerationNumber Theory |
| Range Addition II | Easy | 58.4% | 8.4% | ArrayMath |
| Unique Binary Search Trees | Medium | 63.3% | 8.4% | MathDynamic ProgrammingTree+2 |
| Palindrome Partitioning II | Hard | 36.6% | 8.4% | StringDynamic Programming |
| Maximum Gap | Medium | 51.4% | 8.4% | ArraySortingBucket Sort+1 |
| Find Mode in Binary Search Tree | Easy | 58.5% | 8.4% | TreeDepth-First SearchBinary Search Tree+1 |
| Out of Boundary Paths | Medium | 48.4% | 8.4% | Dynamic Programming |
| Distribute Coins in Binary Tree | Medium | 77.3% | 8.4% | TreeDepth-First SearchBinary Tree |
| Flower Planting With No Adjacent | Medium | 53.4% | 8.4% | Depth-First SearchBreadth-First SearchGraph Theory |
| Stone Game II | Medium | 72.9% | 8.4% | ArrayMathDynamic Programming+2 |
| Group the People Given the Group Size They Belong To | Medium | 87.5% | 8.4% | ArrayHash TableGreedy |
| The kth Factor of n | Medium | 70.2% | 8.4% | MathNumber Theory |
| Sum of All Subset XOR Totals | Easy | 90.1% | 8.4% | ArrayMathBacktracking+3 |
| Maximum Alternating Subsequence Sum | Medium | 59.0% | 8.4% | ArrayDynamic Programming |
| Time Needed to Buy Tickets | Easy | 72.2% | 8.4% | ArrayQueueSimulation |
| Filling Bookcase Shelves | Medium | 68.6% | 8.4% | ArrayDynamic Programming |
| Find Right Interval | Medium | 55.4% | 8.4% | ArrayBinary SearchSorting |
| Split Linked List in Parts | Medium | 70.5% | 8.4% | Linked List |
| Minimized Maximum of Products Distributed to Any Store | Medium | 63.0% | 8.4% | ArrayBinary SearchGreedy |
| Longest Duplicate Substring | Hard | 31.1% | 8.4% | StringBinary SearchSliding Window+3 |
| Linked List in Binary Tree | Medium | 51.9% | 8.4% | Linked ListTreeDepth-First Search+1 |
| Stone Game | Medium | 72.8% | 8.4% | ArrayMathDynamic Programming+1 |
| Count Numbers with Unique Digits | Medium | 55.4% | 8.4% | MathDynamic ProgrammingBacktracking |
| Bulb Switcher | Medium | 55.5% | 8.4% | MathBrainteaser |
| Minimum Swaps to Group All 1's Together II | Medium | 65.6% | 8.4% | ArraySliding Window |
| Most Frequent Subtree Sum | Medium | 68.9% | 8.4% | Hash TableTreeDepth-First Search+1 |
| Find Resultant Array After Removing Anagrams | Easy | 69.9% | 8.4% | ArrayHash TableString+1 |
| Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | 57.4% | 8.4% | ArrayQueueSliding Window+3 |
| Degree of an Array | Easy | 58.2% | 8.4% | ArrayHash Table |
| Average Salary Excluding the Minimum and Maximum Salary | Easy | 63.5% | 8.4% | ArraySorting |
| Score of Parentheses | Medium | 63.6% | 8.4% | StringStack |
| Sum of Prefix Scores of Strings | Hard | 60.8% | 8.4% | ArrayStringTrie+1 |
| Regions Cut By Slashes | Medium | 77.5% | 8.4% | ArrayHash TableDepth-First Search+3 |
| Split a String Into the Max Number of Unique Substrings | Medium | 68.6% | 8.4% | Hash TableStringBacktracking |
| Maximum Number of Points with Cost | Medium | 41.8% | 8.4% | ArrayDynamic ProgrammingMatrix |
| Final Array State After K Multiplication Operations I | Easy | 86.9% | 8.4% | ArrayMathHeap (Priority Queue)+1 |
| Count Pairs Whose Sum is Less than Target | Easy | 87.7% | 8.4% | ArrayTwo PointersBinary Search+1 |
| Find Missing Observations | Medium | 57.4% | 8.4% | ArrayMathSimulation |
| Reach a Number | Medium | 44.6% | 8.4% | MathBinary Search |
| Decrypt String from Alphabet to Integer Mapping | Easy | 80.6% | 8.4% | String |
| Sum of Digits of String After Convert | Easy | 74.8% | 8.4% | StringSimulation |
| Count Univalue Subtrees | Medium | 57.5% | 8.4% | TreeDepth-First SearchBinary Tree |
| Find All Possible Recipes from Given Supplies | Medium | 56.8% | 8.4% | ArrayHash TableString+2 |
| Sentence Similarity III | Medium | 48.5% | 8.4% | ArrayTwo PointersString |
| Grumpy Bookstore Owner | Medium | 64.0% | 8.4% | ArraySliding Window |
| Count Special Subsequences | Medium | 29.8% | 8.4% | ArrayHash TableMath+1 |
| Circular Sentence | Easy | 70.2% | 8.4% | String |
| Number of Visible People in a Queue | Hard | 72.4% | 8.4% | ArrayStackMonotonic Stack |
| Divide Players Into Teams of Equal Skill | Medium | 68.9% | 8.4% | ArrayHash TableTwo Pointers+1 |
| Divide Intervals Into Minimum Number of Groups | Medium | 63.6% | 8.4% | ArrayTwo PointersGreedy+3 |
| Maximum Product of Two Elements in an Array | Easy | 83.5% | 8.4% | ArraySortingHeap (Priority Queue) |
| Grid Game | Medium | 60.9% | 8.4% | ArrayMatrixPrefix Sum |
| Find Original Array From Doubled Array | Medium | 40.7% | 8.4% | ArrayHash TableGreedy+1 |
| Maximum XOR for Each Query | Medium | 84.8% | 8.4% | ArrayBit ManipulationPrefix Sum |
| Remove Methods From Project | Medium | 50.4% | 8.4% | Depth-First SearchBreadth-First SearchGraph Theory |
| Find a Safe Walk Through a Grid | Medium | 32.7% | 8.4% | ArrayBreadth-First SearchGraph Theory+3 |
| Maximum Number of Tasks You Can Assign | Hard | 50.2% | 8.4% | ArrayTwo PointersBinary Search+4 |
| Flip Columns For Maximum Number of Equal Rows | Medium | 78.6% | 8.4% | ArrayHash TableMatrix |
| Nim Game | Easy | 59.3% | 8.4% | MathBrainteaserGame Theory |
| Shifting Letters | Medium | 46.1% | 8.4% | ArrayStringPrefix Sum |
| Special Array II | Medium | 45.8% | 8.4% | ArrayBinary SearchPrefix Sum |
| Adding Spaces to a String | Medium | 71.8% | 8.4% | ArrayTwo PointersString+1 |
| Clumsy Factorial | Medium | 61.1% | 8.4% | MathStackSimulation |
| Number of Sub-arrays With Odd Sum | Medium | 55.8% | 8.4% | ArrayMathDynamic Programming+1 |
| Beautiful Arrangement II | Medium | 61.0% | 8.4% | ArrayMath |
| Last Stone Weight II | Medium | 59.3% | 8.4% | ArrayDynamic Programming |
| Sliding Window Median | Hard | 38.9% | 8.4% | ArrayHash TableSliding Window+1 |
| Minimize XOR | Medium | 62.4% | 8.4% | GreedyBit Manipulation |
| Longest Happy Prefix | Hard | 51.9% | 8.4% | StringRolling HashString Matching+1 |
| Sort the Jumbled Numbers | Medium | 60.0% | 8.4% | ArraySorting |
| Shortest Path in a Hidden Grid | Medium | 44.5% | 8.4% | ArrayDepth-First SearchBreadth-First Search+2 |
| Word Subsets | Medium | 55.9% | 8.4% | ArrayHash TableString |
| Maximum and Minimum Sums of at Most Size K Subsequences | Medium | 21.6% | 8.4% | ArrayMathDynamic Programming+2 |
| Construct Quad Tree | Medium | 78.1% | 8.4% | ArrayDivide and ConquerTree+1 |
| Partition Array Into Three Parts With Equal Sum | Easy | 42.6% | 8.4% | ArrayGreedy |
| Paint House IV | Medium | 45.1% | 8.4% | ArrayDynamic Programming |
| Convert Binary Number in a Linked List to Integer | Easy | 82.3% | 8.4% | Linked ListMath |
| First Completely Painted Row or Column | Medium | 63.9% | 8.4% | ArrayHash TableMatrix |
| Shortest String That Contains Three Strings | Medium | 31.5% | 8.4% | StringGreedyEnumeration |
| Minimum Time to Make Rope Colorful | Medium | 65.2% | 8.4% | ArrayStringDynamic Programming+1 |
| Number of Equivalent Domino Pairs | Easy | 60.6% | 8.4% | ArrayHash TableCounting |
| Count Good Triplets in an Array | Hard | 65.8% | 8.4% | ArrayBinary SearchDivide and Conquer+4 |
| Find Unique Binary String | Medium | 79.4% | 8.4% | ArrayHash TableString+1 |
| Largest Number At Least Twice of Others | Easy | 52.1% | 8.4% | ArraySorting |
| Count Total Number of Colored Cells | Medium | 66.1% | 8.4% | Math |
| Walls and Gates | Medium | 63.8% | 8.4% | ArrayBreadth-First SearchMatrix |
| Alice and Bob Playing Flower Game | Medium | 60.1% | 8.4% | Math |
| Count Vowel Strings in Ranges | Medium | 67.8% | 8.4% | ArrayStringPrefix Sum |
| Find Words Containing Character | Easy | 90.4% | 8.4% | ArrayString |
| Find the Minimum and Maximum Number of Nodes Between Critical Points | Medium | 69.5% | 8.4% | Linked List |
| Longest Univalue Path | Medium | 43.6% | 8.4% | TreeDepth-First SearchBinary Tree |
| Choose K Elements With Maximum Sum | Medium | 33.3% | 8.4% | ArraySortingHeap (Priority Queue) |
| Maximum Units on a Truck | Easy | 74.7% | 8.4% | ArrayGreedySorting |
| Maximum Number of Points From Grid Queries | Hard | 59.3% | 8.4% | ArrayTwo PointersBreadth-First Search+4 |
| Solving Questions With Brainpower | Medium | 60.2% | 8.4% | ArrayDynamic Programming |
| Maximum Palindromes After Operations | Medium | 45.6% | 8.4% | ArrayHash TableString+3 |
| A Number After a Double Reversal | Easy | 82.0% | 8.4% | Math |
| Count Number of Bad Pairs | Medium | 54.2% | 8.4% | ArrayHash TableMath+1 |
| Count of Interesting Subarrays | Medium | 58.0% | 8.4% | ArrayHash TablePrefix Sum |
| Count Equal and Divisible Pairs in an Array | Easy | 84.0% | 8.4% | Array |
| Equal Row and Column Pairs | Medium | 70.8% | 8.4% | ArrayHash TableMatrix+1 |
| Check if Two Chessboard Squares Have the Same Color | Easy | 72.2% | 8.4% | MathString |
| Minimum Number Game | Easy | 85.4% | 8.4% | ArraySortingHeap (Priority Queue)+1 |
| Find Maximum Number of Non Intersecting Substrings | Medium | 30.4% | 8.4% | Hash TableStringDynamic Programming+1 |
| Maximum Sum of Edge Values in a Graph | Hard | 35.7% | 8.4% | MathGreedyGraph Theory |
| Maximize Subarrays After Removing One Conflicting Pair | Hard | 64.7% | 8.4% | ArraySegment TreeEnumeration+1 |
| Merge Two 2D Arrays by Summing Values | Easy | 81.7% | 8.4% | ArrayHash TableTwo Pointers |
| Minimum Moves to Clean the Classroom | Medium | 26.5% | 8.4% | ArrayHash TableBit Manipulation+2 |
| Move Pieces to Obtain a String | Medium | 56.7% | 8.4% | Two PointersString |
| Lexicographically Minimum String After Removing Stars | Medium | 51.0% | 8.4% | Hash TableStringStack+2 |
| Beautiful Arrangement | Medium | 64.7% | 8.4% | ArrayDynamic ProgrammingBacktracking+2 |
| Find Closest Node to Given Two Nodes | Medium | 53.0% | 8.4% | Depth-First SearchGraph Theory |
| Construct Binary Tree from String | Medium | 58.7% | 8.4% | StringStackTree+2 |
| Furthest Building You Can Reach | Medium | 50.7% | 8.4% | ArrayGreedyHeap (Priority Queue) |
| Scramble String | Hard | 43.9% | 8.4% | StringDynamic Programming |
| Maximum Number of Operations to Move Ones to the End | Medium | 67.1% | 8.4% | StringGreedyCounting |
| Keep Multiplying Found Values by Two | Easy | 75.1% | 8.4% | ArrayHash TableSorting+1 |
| Decoded String at Index | Medium | 37.3% | 8.4% | StringStack |
| Minimum Operations to Make the Array Alternating | Medium | 35.4% | 8.4% | ArrayHash TableGreedy+1 |
| Is Graph Bipartite? | Medium | 58.9% | 8.4% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Maximum Candies You Can Get from Boxes | Hard | 67.9% | 8.4% | ArrayBreadth-First SearchGraph Theory |
| Find the Lexicographically Largest String From the Box I | Medium | 41.0% | 8.4% | Two PointersStringEnumeration |
| Maximum Difference Between Adjacent Elements in a Circular Array | Easy | 75.7% | 8.4% | Array |
| Longest Arithmetic Subsequence | Medium | 49.9% | 8.4% | ArrayHash TableBinary Search+1 |
| Minimum Moves to Reach Target in Grid | Hard | 14.9% | 8.4% | Math |
| Student Attendance Record II | Hard | 56.4% | 8.4% | Dynamic Programming |
| Maximum Difference Between Even and Odd Frequency II | Hard | 48.7% | 8.4% | StringSliding WindowEnumeration+1 |
| The Number of Beautiful Subsets | Medium | 50.9% | 8.4% | ArrayHash TableMath+4 |
| Generate Tag for Video Caption | Easy | 32.3% | 8.4% | StringSimulation |
| Minimum Difference in Sums After Removal of Elements | Hard | 69.8% | 8.4% | ArrayDynamic ProgrammingHeap (Priority Queue) |
| Sum of k-Mirror Numbers | Hard | 63.8% | 8.4% | MathEnumeration |
| Find Subarrays With Equal Sum | Easy | 66.9% | 8.4% | ArrayHash Table |
| Check if All A's Appears Before All B's | Easy | 73.1% | 8.4% | String |
| Largest Number After Digit Swaps by Parity | Easy | 65.0% | 8.4% | SortingHeap (Priority Queue) |
| Circular Array Loop | Medium | 37.0% | 8.4% | ArrayHash TableTwo Pointers |
| Student Attendance Record I | Easy | 50.0% | 8.4% | String |
| Generate Fibonacci Sequence | Easy | 83.7% | 8.4% | |
| Find the Original Typed String II | Hard | 45.6% | 8.4% | StringDynamic ProgrammingPrefix Sum |
| Reschedule Meetings for Maximum Free Time I | Medium | 53.9% | 8.4% | ArrayGreedySliding Window |
| Calculator with Method Chaining | Easy | 77.6% | 8.4% | |
| Make Two Arrays Equal by Reversing Subarrays | Easy | 75.8% | 8.4% | ArrayHash TableSorting |
| The Earliest and Latest Rounds Where Players Compete | Hard | 72.7% | 8.4% | Dynamic ProgrammingMemoization |
| Orderly Queue | Hard | 66.7% | 8.4% | MathStringSorting |
| Numbers With Same Consecutive Differences | Medium | 59.1% | 8.4% | BacktrackingBreadth-First Search |
| Range Product Queries of Powers | Medium | 61.4% | 8.4% | ArrayBit ManipulationPrefix Sum |
| Long Pressed Name | Easy | 32.8% | 8.4% | Two PointersString |
| Memoize | Medium | 64.8% | 8.4% | |
| Total Hamming Distance | Medium | 54.6% | 8.4% | ArrayMathBit Manipulation |
| Largest Local Values in a Matrix | Easy | 87.7% | 8.4% | ArrayMatrix |
| Add Two Promises | Easy | 91.8% | 8.4% | |
| Non-negative Integers without Consecutive Ones | Hard | 41.7% | 8.4% | Dynamic Programming |
| Count Number of Maximum Bitwise-OR Subsets | Medium | 89.6% | 8.4% | ArrayBacktrackingBit Manipulation+1 |
| Minimum Cuts to Divide a Circle | Easy | 56.1% | 8.4% | MathGeometry |
| The Maze | Medium | 60.3% | 8.4% | ArrayDepth-First SearchBreadth-First Search+1 |
| Rearranging Fruits | Hard | 57.5% | 8.4% | ArrayHash TableGreedy+1 |
| Broken Calculator | Medium | 55.9% | 8.4% | MathGreedy |
| Delete Duplicate Folders in System | Hard | 77.7% | 8.4% | ArrayHash TableString+4 |
| Generate Binary Strings Without Adjacent Zeros | Medium | 88.2% | 8.4% | StringBacktrackingBit Manipulation |
| Difference Between Element Sum and Digit Sum of an Array | Easy | 85.3% | 8.4% | ArrayMath |
| Minimum Number of People to Teach | Medium | 67.7% | 8.4% | ArrayHash TableGreedy |
| Number of Distinct Substrings in a String | Medium | 64.8% | 8.4% | StringTrieRolling Hash+2 |
| Linked List Components | Medium | 57.8% | 8.4% | ArrayHash TableLinked List |
| Check If All 1's Are at Least Length K Places Away | Easy | 64.3% | 8.4% | Array |
| Sort Array By Parity II | Easy | 71.2% | 8.4% | ArrayTwo PointersSorting |
| Minimum Interval to Include Each Query | Hard | 54.0% | 8.4% | ArrayBinary SearchSweep Line+2 |
| Bitwise AND of Numbers Range | Medium | 48.7% | 8.4% | Bit Manipulation |
| Sort Items by Groups Respecting Dependencies | Hard | 65.6% | 8.4% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Patients With a Condition | Easy | 38.8% | 8.4% | Database |
| Find Beautiful Indices in the Given Array I | Medium | 40.5% | 8.4% | Two PointersStringBinary Search+3 |
| Smallest Integer Divisible by K | Medium | 54.3% | 8.4% | Hash TableMath |
| Letter Case Permutation | Medium | 75.7% | 8.4% | StringBacktrackingBit Manipulation |
| Maximum Subsequence Score | Medium | 54.6% | 8.4% | ArrayGreedySorting+1 |
| Pass the Pillow | Easy | 56.6% | 8.4% | MathSimulation |
| Tenth Line | Easy | 36.2% | 8.4% | Shell |
| Smallest String With Swaps | Medium | 60.4% | 8.4% | ArrayHash TableString+4 |
| Find Closest Person | Easy | 88.9% | 8.4% | Math |
| Select Data | Easy | 78.7% | 8.4% | |
| Minimum Number of Operations to Make Array Continuous | Hard | 52.1% | 8.4% | ArrayHash TableBinary Search+1 |
| Adjacent Increasing Subarrays Detection I | Easy | 48.0% | 8.4% | Array |
| Lexicographically Smallest Equivalent String | Medium | 81.1% | 8.4% | StringUnion-Find |
| Fraction to Recurring Decimal | Medium | 30.6% | 8.4% | Hash TableMathString |
| Maximum Number of Distinct Elements After Operations | Medium | 52.2% | 8.4% | ArrayGreedySorting |
| Find the Winning Player in Coin Game | Easy | 53.1% | 8.4% | MathSimulationGame Theory |
| Maximum Frequency After Subarray Operation | Medium | 30.9% | 8.4% | ArrayHash TableDynamic Programming+3 |
| Dota2 Senate | Medium | 49.6% | 8.4% | StringGreedyQueue |
| Maximal Square | Medium | 50.0% | 8.4% | ArrayDynamic ProgrammingMatrix |
| Tiling a Rectangle with the Fewest Squares | Hard | 54.8% | 8.4% | Backtracking |
| Maximum Ascending Subarray Sum | Easy | 66.3% | 8.4% | Array |
| Smallest Number in Infinite Set | Medium | 70.6% | 8.4% | Hash TableDesignHeap (Priority Queue)+1 |
| Merge In Between Linked Lists | Medium | 82.9% | 8.4% | Linked List |
| Max Chunks To Make Sorted II | Hard | 54.7% | 8.4% | ArrayStackGreedy+2 |
| Count the Number of Substrings With Dominant Ones | Medium | 42.1% | 8.4% | StringEnumeration |
| K Radius Subarray Averages | Medium | 46.1% | 8.4% | ArraySliding Window |
| Classes With at Least 5 Students | Easy | 63.2% | 8.4% | Database |
| Add One Row to Tree | Medium | 64.1% | 8.4% | TreeDepth-First SearchBreadth-First Search+1 |
| Robot Bounded In Circle | Medium | 56.5% | 8.4% | MathStringSimulation |
| Frog Jump | Hard | 47.1% | 8.4% | ArrayDynamic Programming |
| Minimum Operations to Reduce an Integer to 0 | Medium | 61.1% | 8.4% | Dynamic ProgrammingGreedyBit Manipulation |
| Reverse Nodes in Even Length Groups | Medium | 63.7% | 8.4% | Linked List |
| Maximum Difference Between Node and Ancestor | Medium | 78.1% | 8.4% | TreeDepth-First SearchBinary Tree |
| Water Bottles | Easy | 72.6% | 8.4% | MathSimulation |
| Design Tic-Tac-Toe | Medium | 58.7% | 8.4% | ArrayHash TableDesign+2 |
| Number of Ways to Form a Target String Given a Dictionary | Hard | 56.6% | 8.4% | ArrayStringDynamic Programming |
| Find X-Sum of All K-Long Subarrays II | Hard | 41.1% | 8.4% | ArrayHash TableSliding Window+1 |
| Minimum One Bit Operations to Make Integers Zero | Hard | 78.5% | 8.4% | MathDynamic ProgrammingBit Manipulation+2 |
| Minimum Changes To Make Alternating Binary String | Easy | 63.8% | 8.4% | String |
| 1-bit and 2-bit Characters | Easy | 49.5% | 8.4% | Array |
| Replace Non-Coprime Numbers in Array | Hard | 57.7% | 8.4% | ArrayMathStack+1 |
| Count Mentions Per User | Medium | 50.8% | 8.4% | ArrayMathSorting+1 |
| Battleships in a Board | Medium | 77.4% | 8.4% | ArrayDepth-First SearchMatrix |
| Russian Doll Envelopes | Hard | 37.7% | 8.4% | ArrayBinary SearchDynamic Programming+1 |
| Greatest Sum Divisible by Three | Medium | 57.1% | 8.4% | ArrayDynamic ProgrammingGreedy+1 |
| Maximum Sum BST in Binary Tree | Hard | 46.5% | 8.4% | Dynamic ProgrammingTreeDepth-First Search+2 |
| Tree Node | Medium | 75.2% | 8.4% | Database |
| Minimum Moves to Convert String | Easy | 57.7% | 8.4% | StringGreedy |
| Make Sum Divisible by P | Medium | 42.6% | 8.4% | ArrayHash TablePrefix Sum |
| The Skyline Problem | Hard | 45.0% | 8.4% | ArrayDivide and ConquerBinary Indexed Tree+5 |
| Insert Greatest Common Divisors in Linked List | Medium | 91.4% | 8.4% | Linked ListMathNumber Theory |
| Number of Unique Subjects Taught by Each Teacher | Easy | 89.2% | 8.4% | Database |
| Put Marbles in Bags | Hard | 72.2% | 8.4% | ArrayGreedySorting+1 |
| Maximum Running Time of N Computers | Hard | 56.4% | 8.4% | ArrayBinary SearchGreedy+1 |
| Employee Free Time | Hard | 72.8% | 8.4% | ArraySweep LineSorting+1 |
| Closest Binary Search Tree Value | Easy | 49.3% | 8.4% | Binary SearchTreeDepth-First Search+2 |
| Count Partitions with Even Sum Difference | Easy | 85.2% | 8.4% | ArrayMathPrefix Sum |
| Cinema Seat Allocation | Medium | 43.6% | 8.4% | ArrayHash TableGreedy+1 |
| Get Equal Substrings Within Budget | Medium | 59.5% | 8.4% | StringBinary SearchSliding Window+1 |
| Count Number of Trapezoids I | Medium | 48.0% | 8.4% | ArrayHash TableMath+1 |
| Number of Ways to Divide a Long Corridor | Hard | 54.6% | 8.4% | MathStringDynamic Programming |
| Design Spreadsheet | Medium | 74.3% | 8.4% | ArrayHash TableString+2 |
| Arithmetic Slices II - Subsequence | Hard | 54.9% | 8.4% | ArrayDynamic Programming |
| Root Equals Sum of Children | Easy | 84.9% | 8.4% | TreeBinary Tree |
| Maximum Frequency of an Element After Performing Operations II | Hard | 53.9% | 8.4% | ArrayBinary SearchSliding Window+2 |
| Count Square Sum Triples | Easy | 77.1% | 8.4% | MathEnumeration |
| Minimum Moves to Balance Circular Array | Medium | 40.2% | 8.4% | ArrayGreedySorting |
| Meeting Rooms III | Hard | 51.6% | 8.4% | ArrayHash TableSorting+2 |
| Delete Columns to Make Sorted II | Medium | 49.7% | 8.4% | ArrayStringGreedy |
| Number of Good Paths | Hard | 56.3% | 8.4% | ArrayHash TableTree+3 |
| Analyze Subscription Conversion | Medium | 74.1% | 8.4% | Database |
| Equal Sum Grid Partition I | Medium | | 8.4% | ArrayMatrixEnumeration+1 |
| Apple Redistribution into Boxes | Easy | 78.5% | 8.4% | ArrayGreedySorting |
| Number of ZigZag Arrays I | Hard | | 8.4% | Dynamic ProgrammingPrefix Sum |
| Count the Number of Inversions | Hard | 29.7% | 8.4% | ArrayDynamic Programming |
| Largest Positive Integer That Exists With Its Negative | Easy | 74.5% | 8.4% | ArrayHash TableTwo Pointers+1 |
| Kth Smallest Element in a Sorted Matrix | Medium | 64.4% | 8.4% | ArrayBinary SearchSorting+2 |
| Design Circular Queue | Medium | 54.0% | 8.4% | ArrayLinked ListDesign+1 |
| Minimum Falling Path Sum II | Hard | 63.2% | 8.4% | ArrayDynamic ProgrammingMatrix |
| Find Minimum Operations to Make All Elements Divisible by Three | Easy | 90.9% | 8.4% | ArrayMath |
| Check if Array is Good | Easy | 48.7% | 8.4% | ArrayHash TableSorting |
| Sum of Unique Elements | Easy | 79.8% | 8.4% | ArrayHash TableCounting |
| Minimum Common Value | Easy | 58.0% | 8.4% | ArrayHash TableTwo Pointers+1 |
| Find Minimum Cost to Remove Array Elements | Medium | 21.3% | 8.4% | ArrayDynamic Programming |
| Mini Parser | Medium | 42.0% | 8.4% | StringStackDepth-First Search |
| Soup Servings | Medium | 59.7% | 8.4% | MathDynamic ProgrammingProbability and Statistics |
| Max Dot Product of Two Subsequences | Hard | 69.3% | 8.4% | ArrayDynamic Programming |
| Find Missing Elements | Easy | 82.9% | 8.4% | ArrayHash TableSorting |
| Number of Perfect Pairs | Medium | 33.4% | 8.4% | ArrayMathTwo Pointers+1 |
| Construct the Minimum Bitwise Array I | Easy | 85.3% | 8.4% | ArrayBit Manipulation |
| Minimum Cost Path with Edge Reversals | Medium | 61.8% | 8.4% | Graph TheoryHeap (Priority Queue)Shortest Path |
| Minimize String Length | Easy | 78.9% | 8.4% | Hash TableString |
| Rectangle Area | Medium | 49.0% | 8.4% | MathGeometry |
| Find Words That Can Be Formed by Characters | Easy | 71.5% | 8.4% | ArrayHash TableString+1 |
| Find And Replace in String | Medium | 50.9% | 8.4% | ArrayHash TableString+1 |
| Binary Gap | Easy | 74.1% | 8.4% | Bit Manipulation |
| Trionic Array II | Hard | 47.3% | 8.4% | ArrayDynamic Programming |
| Convert 1D Array Into 2D Array | Easy | 72.1% | 8.4% | ArrayMatrixSimulation |
| GCD of Odd and Even Sums | Easy | 84.8% | 8.4% | MathNumber Theory |
| Self Crossing | Hard | 34.2% | 8.4% | ArrayMathGeometry |
| The Dining Philosophers | Medium | 54.2% | 8.4% | Concurrency |
| Max Consecutive Ones II | Medium | 51.9% | 8.4% | ArrayDynamic ProgrammingSliding Window |
| Partition to K Equal Sum Subsets | Medium | 38.4% | 8.4% | ArrayDynamic ProgrammingBacktracking+3 |
| Construct the Lexicographically Largest Valid Sequence | Medium | 72.8% | 8.4% | ArrayBacktracking |
| Minimum Knight Moves | Medium | 41.8% | 8.4% | Breadth-First Search |
| Remove Invalid Parentheses | Hard | 49.8% | 8.4% | StringBacktrackingBreadth-First Search |
| Swap Adjacent in LR String | Medium | 37.9% | 8.4% | Two PointersString |
| Find the Number of Ways to Place People I | Medium | 64.0% | 8.4% | ArrayMathGeometry+2 |
| Binary Tree Level Order Traversal II | Medium | 67.7% | 8.4% | TreeBreadth-First SearchBinary Tree |
| The K Weakest Rows in a Matrix | Easy | 74.3% | 8.4% | ArrayBinary SearchSorting+2 |
| Maximum Frequency of an Element After Performing Operations I | Medium | 40.1% | 8.4% | ArrayBinary SearchSliding Window+2 |
| Daily Leads and Partners | Easy | | 8.4% | Database |
| Find the Closest Palindrome | Hard | 31.8% | 8.4% | MathString |
| Construct Product Matrix | Medium | 32.1% | 8.4% | ArrayMatrixPrefix Sum |
| Count Unguarded Cells in the Grid | Medium | 69.0% | 8.4% | ArrayMatrixSimulation |
| Human Traffic of Stadium | Hard | 50.8% | 8.4% | Database |
| Maximal Score After Applying K Operations | Medium | 64.0% | 8.4% | ArrayGreedyHeap (Priority Queue) |
| Find the Largest Almost Missing Integer | Easy | 37.1% | 8.4% | ArrayHash Table |
| Shortest Common Supersequence | Hard | 61.8% | 8.4% | StringDynamic Programming |
| Beautiful Array | Medium | 68.7% | 8.4% | ArrayMathDivide and Conquer |
| Maximize the Distance Between Points on a Square | Hard | | 8.4% | ArrayMathBinary Search+2 |
| Insertion Sort List | Medium | 58.5% | 8.4% | Linked ListSorting |
| Substrings of Size Three with Distinct Characters | Easy | 76.6% | 8.4% | Hash TableStringSliding Window+1 |
| Jump Game IX | Medium | 23.8% | 8.4% | ArrayDynamic Programming |
| Binary Number with Alternating Bits | Easy | 69.8% | 8.4% | Bit Manipulation |
| Build an Array With Stack Operations | Medium | 81.0% | 8.4% | ArrayStackSimulation |
| Swapping Nodes in a Linked List | Medium | 69.2% | 8.4% | Linked ListTwo Pointers |
| Design Snake Game | Medium | 40.0% | 8.4% | ArrayHash TableDesign+2 |
| Minimum Moves to Equal Array Elements | Medium | 58.5% | 8.4% | ArrayMath |
| Number of Boomerangs | Medium | 57.3% | 8.4% | ArrayHash TableMath |
| Check If Array Pairs Are Divisible by k | Medium | 46.2% | 8.4% | ArrayHash TableCounting |
| Minimum Number of Coins to be Added | Medium | 58.0% | 8.4% | ArrayGreedySorting |
| Minimum Jumps to Reach Home | Medium | 30.6% | 8.4% | ArrayHash TableBreadth-First Search |
| Reverse Words in a String III | Easy | 83.9% | 8.4% | Two PointersString |
| Weighted Word Mapping | Easy | | 8.4% | ArrayStringSimulation |
| Stock Price Fluctuation | Medium | 48.9% | 8.4% | Hash TableDesignHeap (Priority Queue)+2 |
| Maximum Ice Cream Bars | Medium | 74.2% | 8.4% | ArrayGreedySorting+1 |
| Minimum Swaps To Make Sequences Increasing | Hard | 41.3% | 8.4% | ArrayDynamic Programming |
| Word Frequency | Medium | 28.4% | 8.4% | Shell |
| Count Square Submatrices with All Ones | Medium | 80.7% | 8.4% | ArrayDynamic ProgrammingMatrix |