| Two Sum | Easy | 57.1% | 100.0% | ArrayHash Table |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 87.5% | Hash TableStringSliding Window |
| Trapping Rain Water | Hard | 66.8% | 87.5% | ArrayTwo PointersDynamic Programming+2 |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 87.5% | ArrayDynamic Programming |
| LRU Cache | Medium | 46.8% | 87.5% | Hash TableLinked ListDesign+1 |
| Number of Islands | Medium | 63.8% | 87.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Add Two Numbers | Medium | 47.9% | 75.0% | Linked ListMathRecursion |
| Median of Two Sorted Arrays | Hard | 45.9% | 75.0% | ArrayBinary SearchDivide and Conquer |
| Longest Palindromic Substring | Medium | 37.3% | 75.0% | Two PointersStringDynamic Programming |
| Palindrome Number | Easy | 60.2% | 75.0% | Math |
| Container With Most Water | Medium | 59.5% | 75.0% | ArrayTwo PointersGreedy |
| Longest Common Prefix | Easy | 47.1% | 75.0% | ArrayStringTrie |
| 3Sum | Medium | 38.6% | 75.0% | ArrayTwo PointersSorting |
| Valid Parentheses | Easy | 43.7% | 75.0% | StringStack |
| Merge k Sorted Lists | Hard | 58.8% | 75.0% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Search in Rotated Sorted Array | Medium | 44.1% | 75.0% | ArrayBinary Search |
| Group Anagrams | Medium | 72.2% | 75.0% | ArrayHash TableString+1 |
| Maximum Subarray | Medium | 53.0% | 75.0% | ArrayDivide and ConquerDynamic Programming |
| Jump Game | Medium | 40.5% | 75.0% | ArrayDynamic ProgrammingGreedy |
| Merge Intervals | Medium | 51.1% | 75.0% | ArraySorting |
| Merge Sorted Array | Easy | 54.4% | 75.0% | ArrayTwo PointersSorting |
| Word Ladder | Hard | 44.9% | 75.0% | Hash TableStringBreadth-First Search |
| Longest Consecutive Sequence | Medium | 47.0% | 75.0% | ArrayHash TableUnion-Find |
| Copy List with Random Pointer | Medium | 62.4% | 75.0% | Hash TableLinked List |
| Course Schedule | Medium | 50.8% | 75.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.7% | 75.0% | TreeDepth-First SearchBinary Tree |
| Top K Frequent Elements | Medium | 65.8% | 75.0% | ArrayHash TableDivide and Conquer+5 |
| Subarray Sum Equals K | Medium | 46.8% | 75.0% | ArrayHash TablePrefix Sum |
| Reorganize String | Medium | 56.8% | 75.0% | Hash TableStringGreedy+3 |
| Koko Eating Bananas | Medium | 49.7% | 75.0% | ArrayBinary Search |
| Rotting Oranges | Medium | 58.1% | 75.0% | ArrayBreadth-First SearchMatrix |
| Reverse Integer | Medium | 31.5% | 62.5% | Math |
| Regular Expression Matching | Hard | 30.4% | 62.5% | StringDynamic ProgrammingRecursion |
| Roman to Integer | Easy | 66.2% | 62.5% | Hash TableMathString |
| Letter Combinations of a Phone Number | Medium | 65.5% | 62.5% | Hash TableStringBacktracking |
| 4Sum | Medium | 40.0% | 62.5% | ArrayTwo PointersSorting |
| Merge Two Sorted Lists | Easy | 67.9% | 62.5% | Linked ListRecursion |
| Generate Parentheses | Medium | 78.2% | 62.5% | StringDynamic ProgrammingBacktracking |
| Remove Duplicates from Sorted Array | Easy | 62.2% | 62.5% | ArrayTwo Pointers |
| Next Permutation | Medium | 44.7% | 62.5% | ArrayTwo Pointers |
| Find First and Last Position of Element in Sorted Array | Medium | 48.3% | 62.5% | ArrayBinary Search |
| Valid Sudoku | Medium | 64.1% | 62.5% | ArrayHash TableMatrix |
| First Missing Positive | Hard | 42.4% | 62.5% | ArrayHash Table |
| Jump Game II | Medium | 42.4% | 62.5% | ArrayDynamic ProgrammingGreedy |
| Rotate Image | Medium | 79.3% | 62.5% | ArrayMathMatrix |
| N-Queens | Hard | 74.9% | 62.5% | ArrayBacktracking |
| Spiral Matrix | Medium | 56.1% | 62.5% | ArrayMatrixSimulation |
| Unique Paths | Medium | 66.5% | 62.5% | MathDynamic ProgrammingCombinatorics |
| Sqrt(x) | Easy | 41.4% | 62.5% | MathBinary Search |
| Climbing Stairs | Easy | 53.9% | 62.5% | MathDynamic ProgrammingMemoization |
| Search a 2D Matrix | Medium | 53.5% | 62.5% | ArrayBinary SearchMatrix |
| Sort Colors | Medium | 69.1% | 62.5% | ArrayTwo PointersSorting |
| Minimum Window Substring | Hard | 46.9% | 62.5% | Hash TableStringSliding Window |
| Subsets | Medium | 82.0% | 62.5% | ArrayBacktrackingBit Manipulation |
| Word Search | Medium | 46.8% | 62.5% | ArrayStringBacktracking+2 |
| Largest Rectangle in Histogram | Hard | 49.3% | 62.5% | ArrayStackMonotonic Stack |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.1% | 62.5% | TreeBreadth-First SearchBinary Tree |
| Pascal's Triangle | Easy | 78.7% | 62.5% | ArrayDynamic Programming |
| Best Time to Buy and Sell Stock II | Medium | 70.7% | 62.5% | ArrayDynamic ProgrammingGreedy |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 62.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Gas Station | Medium | 47.5% | 62.5% | ArrayGreedy |
| Single Number | Easy | 77.3% | 62.5% | ArrayBit Manipulation |
| Word Break | Medium | 49.1% | 62.5% | ArrayHash TableString+3 |
| Min Stack | Medium | 57.7% | 62.5% | StackDesign |
| Find Peak Element | Medium | 46.8% | 62.5% | ArrayBinary Search |
| Majority Element | Easy | 66.1% | 62.5% | ArrayHash TableDivide and Conquer+2 |
| Rotate Array | Medium | 44.4% | 62.5% | ArrayMathTwo Pointers |
| House Robber | Medium | 52.9% | 62.5% | ArrayDynamic Programming |
| Course Schedule II | Medium | 55.0% | 62.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Kth Largest Element in an Array | Medium | 68.8% | 62.5% | ArrayDivide and ConquerSorting+2 |
| Product of Array Except Self | Medium | 68.6% | 62.5% | ArrayPrefix Sum |
| Sliding Window Maximum | Hard | 48.4% | 62.5% | ArrayQueueSliding Window+2 |
| Valid Anagram | Easy | 67.8% | 62.5% | Hash TableStringSorting |
| Meeting Rooms II | Medium | 52.5% | 62.5% | |
| Missing Number | Easy | 71.6% | 62.5% | ArrayHash TableMath+3 |
| Move Zeroes | Easy | 63.5% | 62.5% | ArrayTwo Pointers |
| Find Median from Data Stream | Hard | 54.2% | 62.5% | Two PointersDesignSorting+2 |
| Serialize and Deserialize Binary Tree | Hard | 60.3% | 62.5% | StringTreeDepth-First Search+3 |
| Coin Change | Medium | 47.9% | 62.5% | ArrayDynamic ProgrammingBreadth-First Search |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 62.5% | ArrayHash TableMath+2 |
| Single Element in a Sorted Array | Medium | 59.2% | 62.5% | ArrayBinary Search |
| Task Scheduler | Medium | 62.6% | 62.5% | ArrayHash TableGreedy+3 |
| Asteroid Collision | Medium | 47.1% | 62.5% | ArrayStackSimulation |
| Daily Temperatures | Medium | 68.3% | 62.5% | ArrayStackMonotonic Stack |
| Analyze User Website Visit Pattern | Medium | 44.2% | 62.5% | |
| Merge Strings Alternately | Easy | 82.1% | 62.5% | Two PointersString |
| Recyclable and Low Fat Products | Easy | 88.8% | 62.5% | Database |
| Create Hello World Function | Easy | 82.0% | 62.5% | |
| Identify the Largest Outlier in an Array | Medium | 36.2% | 62.5% | ArrayHash TableCounting+1 |
| Zigzag Conversion | Medium | 53.5% | 50.0% | String |
| String to Integer (atoi) | Medium | 20.6% | 50.0% | String |
| Integer to Roman | Medium | 70.4% | 50.0% | Hash TableMathString |
| 3Sum Closest | Medium | 48.0% | 50.0% | ArrayTwo PointersSorting |
| Remove Nth Node From End of List | Medium | 51.0% | 50.0% | Linked ListTwo Pointers |
| Reverse Nodes in k-Group | Hard | 65.3% | 50.0% | Linked ListRecursion |
| Remove Element | Easy | 61.3% | 50.0% | ArrayTwo Pointers |
| Find the Index of the First Occurrence in a String | Easy | 46.2% | 50.0% | Two PointersStringString Matching |
| Divide Two Integers | Medium | 19.4% | 50.0% | MathBit Manipulation |
| Longest Valid Parentheses | Hard | 38.0% | 50.0% | StringDynamic ProgrammingStack |
| Search Insert Position | Easy | 50.7% | 50.0% | ArrayBinary Search |
| Sudoku Solver | Hard | 65.4% | 50.0% | ArrayHash TableBacktracking+1 |
| Combination Sum | Medium | 76.1% | 50.0% | ArrayBacktracking |
| Permutations | Medium | 81.6% | 50.0% | ArrayBacktracking |
| Pow(x, n) | Medium | 38.2% | 50.0% | MathRecursion |
| Length of Last Word | Easy | 58.3% | 50.0% | String |
| Rotate List | Medium | 41.2% | 50.0% | Linked ListTwo Pointers |
| Minimum Path Sum | Medium | 67.8% | 50.0% | ArrayDynamic ProgrammingMatrix |
| Plus One | Easy | 49.5% | 50.0% | ArrayMath |
| Add Binary | Easy | 57.6% | 50.0% | MathStringBit Manipulation+1 |
| Simplify Path | Medium | 50.0% | 50.0% | StringStack |
| Edit Distance | Medium | 60.1% | 50.0% | StringDynamic Programming |
| Set Matrix Zeroes | Medium | 62.4% | 50.0% | ArrayHash TableMatrix |
| Remove Duplicates from Sorted Array II | Medium | 64.3% | 50.0% | ArrayTwo Pointers |
| Maximal Rectangle | Hard | 58.1% | 50.0% | ArrayDynamic ProgrammingStack+2 |
| Subsets II | Medium | 60.9% | 50.0% | ArrayBacktrackingBit Manipulation |
| Reverse Linked List II | Medium | 51.0% | 50.0% | Linked List |
| Validate Binary Search Tree | Medium | 35.3% | 50.0% | TreeDepth-First SearchBinary Search Tree+1 |
| Symmetric Tree | Easy | 60.7% | 50.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Binary Tree Level Order Traversal | Medium | 72.2% | 50.0% | TreeBreadth-First SearchBinary Tree |
| Maximum Depth of Binary Tree | Easy | 77.9% | 50.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | 68.3% | 50.0% | ArrayHash TableDivide and Conquer+2 |
| Balanced Binary Tree | Easy | 57.8% | 50.0% | TreeDepth-First SearchBinary Tree |
| Populating Next Right Pointers in Each Node | Medium | 66.8% | 50.0% | Linked ListTreeDepth-First Search+2 |
| Valid Palindrome | Easy | 52.8% | 50.0% | Two PointersString |
| Word Ladder II | Hard | 27.5% | 50.0% | Hash TableStringBacktracking+1 |
| Surrounded Regions | Medium | 44.7% | 50.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Palindrome Partitioning | Medium | 73.7% | 50.0% | StringDynamic ProgrammingBacktracking |
| Candy | Hard | 47.9% | 50.0% | ArrayGreedy |
| Word Break II | Hard | 55.1% | 50.0% | ArrayHash TableString+4 |
| Linked List Cycle | Easy | 53.9% | 50.0% | Hash TableLinked ListTwo Pointers |
| Reorder List | Medium | 64.6% | 50.0% | Linked ListTwo PointersStack+1 |
| Sort List | Medium | 63.8% | 50.0% | Linked ListTwo PointersDivide and Conquer+2 |
| Evaluate Reverse Polish Notation | Medium | 57.0% | 50.0% | ArrayMathStack |
| Reverse Words in a String | Medium | 55.5% | 50.0% | Two PointersString |
| Maximum Product Subarray | Medium | 36.0% | 50.0% | ArrayDynamic Programming |
| Find Minimum in Rotated Sorted Array | Medium | 53.8% | 50.0% | ArrayBinary Search |
| Intersection of Two Linked Lists | Easy | 63.2% | 50.0% | Hash TableLinked ListTwo Pointers |
| Two Sum II - Input Array Is Sorted | Medium | 64.6% | 50.0% | ArrayTwo PointersBinary Search |
| Combine Two Tables | Easy | 79.2% | 50.0% | Database |
| Second Highest Salary | Medium | 46.3% | 50.0% | Database |
| Largest Number | Medium | 42.6% | 50.0% | ArrayStringGreedy+1 |
| Employees Earning More Than Their Managers | Easy | 72.8% | 50.0% | Database |
| Binary Tree Right Side View | Medium | 69.5% | 50.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Happy Number | Easy | 59.2% | 50.0% | Hash TableMathTwo Pointers |
| Count Primes | Medium | 35.7% | 50.0% | ArrayMathEnumeration+1 |
| Isomorphic Strings | Easy | 48.0% | 50.0% | Hash TableString |
| Reverse Linked List | Easy | 80.2% | 50.0% | Linked ListRecursion |
| Minimum Size Subarray Sum | Medium | 51.0% | 50.0% | ArrayBinary SearchSliding Window+1 |
| Word Search II | Hard | 38.1% | 50.0% | ArrayStringBacktracking+2 |
| Contains Duplicate | Easy | 64.1% | 50.0% | ArrayHash TableSorting |
| Contains Duplicate II | Easy | 50.8% | 50.0% | ArrayHash TableSliding Window |
| Basic Calculator | Hard | 46.5% | 50.0% | MathStringStack+1 |
| Basic Calculator II | Medium | 46.6% | 50.0% | MathStringStack |
| Kth Smallest Element in a BST | Medium | 76.5% | 50.0% | TreeDepth-First SearchBinary Search Tree+1 |
| Palindrome Linked List | Easy | 57.4% | 50.0% | Linked ListTwo PointersStack+1 |
| Lowest Common Ancestor of a Binary Search Tree | Medium | 70.0% | 50.0% | TreeDepth-First SearchBinary Search Tree+1 |
| Search a 2D Matrix II | Medium | 56.8% | 50.0% | ArrayBinary SearchDivide and Conquer+1 |
| Integer to English Words | Hard | 34.8% | 50.0% | MathStringRecursion |
| Find the Duplicate Number | Medium | 64.0% | 50.0% | ArrayTwo PointersBinary Search+1 |
| Longest Increasing Subsequence | Medium | 59.0% | 50.0% | ArrayBinary SearchDynamic Programming |
| Odd Even Linked List | Medium | 62.3% | 50.0% | Linked List |
| Reverse String | Easy | 80.5% | 50.0% | Two PointersString |
| Intersection of Two Arrays | Easy | 77.5% | 50.0% | ArrayHash TableTwo Pointers+2 |
| First Unique Character in a String | Easy | 65.0% | 50.0% | Hash TableStringQueue+1 |
| Decode String | Medium | 62.2% | 50.0% | StringStackRecursion |
| Evaluate Division | Medium | 64.0% | 50.0% | ArrayStringDepth-First Search+4 |
| Remove K Digits | Medium | 36.4% | 50.0% | StringStackGreedy+1 |
| Split Array Largest Sum | Hard | 59.8% | 50.0% | ArrayBinary SearchDynamic Programming+2 |
| Fizz Buzz | Easy | 75.2% | 50.0% | MathStringSimulation |
| Partition Equal Subset Sum | Medium | 49.2% | 50.0% | ArrayDynamic Programming |
| Longest Repeating Character Replacement | Medium | 59.0% | 50.0% | Hash TableStringSliding Window |
| Find All Anagrams in a String | Medium | 53.3% | 50.0% | Hash TableStringSliding Window |
| String Compression | Medium | 59.5% | 50.0% | Two PointersString |
| LFU Cache | Hard | 48.6% | 50.0% | Hash TableLinked ListDesign+1 |
| Concatenated Words | Hard | 49.7% | 50.0% | ArrayStringDynamic Programming+3 |
| Max Consecutive Ones | Easy | 64.6% | 50.0% | Array |
| Target Sum | Medium | 51.8% | 50.0% | ArrayDynamic ProgrammingBacktracking |
| Next Greater Element I | Easy | 75.7% | 50.0% | ArrayHash TableStack+1 |
| Next Greater Element II | Medium | 67.9% | 50.0% | ArrayStackMonotonic Stack |
| Contiguous Array | Medium | 50.8% | 50.0% | ArrayHash TablePrefix Sum |
| Diameter of Binary Tree | Easy | 65.0% | 50.0% | TreeDepth-First SearchBinary Tree |
| Number of Provinces | Medium | 70.0% | 50.0% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Permutation in String | Medium | 48.4% | 50.0% | Hash TableTwo PointersString+1 |
| Managers with at Least 5 Direct Reports | Medium | 48.9% | 50.0% | Database |
| Find K Closest Elements | Medium | 49.4% | 50.0% | ArrayTwo PointersBinary Search+3 |
| Maximum Width of Binary Tree | Medium | 45.2% | 50.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Top K Frequent Words | Medium | 60.0% | 50.0% | ArrayHash TableString+5 |
| Flood Fill | Easy | 67.8% | 50.0% | ArrayDepth-First SearchBreadth-First Search+1 |
| Kth Largest Element in a Stream | Easy | 60.7% | 50.0% | TreeDesignBinary Search Tree+3 |
| Peak Index in a Mountain Array | Medium | 66.9% | 50.0% | ArrayBinary Search |
| All Nodes Distance K in Binary Tree | Medium | 67.4% | 50.0% | Hash TableTreeDepth-First Search+2 |
| Middle of the Linked List | Easy | 81.5% | 50.0% | Linked ListTwo Pointers |
| Random Pick with Weight | Medium | 48.9% | 50.0% | ArrayMathBinary Search+2 |
| Fruit Into Baskets | Medium | 50.5% | 50.0% | ArrayHash TableSliding Window |
| Sum of Subarray Minimums | Medium | 38.3% | 50.0% | ArrayDynamic ProgrammingStack+1 |
| Sort an Array | Medium | 55.9% | 50.0% | ArrayDivide and ConquerSorting+5 |
| Fibonacci Number | Easy | 73.9% | 50.0% | MathDynamic ProgrammingRecursion+1 |
| K Closest Points to Origin | Medium | 68.7% | 50.0% | ArrayMathDivide and Conquer+4 |
| Time Based Key-Value Store | Medium | 49.7% | 50.0% | Hash TableStringBinary Search+1 |
| Vertical Order Traversal of a Binary Tree | Hard | 53.2% | 50.0% | Hash TableTreeDepth-First Search+3 |
| Subarrays with K Different Integers | Hard | 67.5% | 50.0% | ArrayHash TableSliding Window+1 |
| Max Consecutive Ones III | Medium | 67.3% | 50.0% | ArrayBinary SearchSliding Window+1 |
| Capacity To Ship Packages Within D Days | Medium | 73.5% | 50.0% | ArrayBinary Search |
| Article Views I | Easy | 76.7% | 50.0% | Database |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 50.0% | ArrayBinary SearchDynamic Programming+1 |
| Search Suggestions System | Medium | 65.2% | 50.0% | ArrayStringBinary Search+3 |
| The kth Factor of n | Medium | 70.2% | 50.0% | MathNumber Theory |
| Lowest Common Ancestor of a Binary Tree III | Medium | 82.9% | 50.0% | |
| Average Time of Process per Machine | Easy | 66.9% | 50.0% | Database |
| Check if Array Is Sorted and Rotated | Easy | 55.7% | 50.0% | Array |
| Plates Between Candles | Medium | 47.3% | 50.0% | ArrayStringBinary Search+1 |
| Rearrange Array Elements by Sign | Medium | 84.5% | 50.0% | ArrayTwo PointersSimulation |
| Minimum Health to Beat Game | Medium | 58.8% | 50.0% | |
| Make Array Zero by Subtracting Equal Amounts | Easy | 73.7% | 50.0% | ArrayHash TableGreedy+3 |
| Minimum Adjacent Swaps to Make a Valid Array | Medium | 72.2% | 50.0% | |
| Maximum Frequency After Subarray Operation | Medium | 30.8% | 50.0% | ArrayHash TableDynamic Programming+3 |
| Minimum Time to Complete All Deliveries | Medium | 34.3% | 50.0% | MathBinary Search |
| Swap Nodes in Pairs | Medium | 68.9% | 37.5% | Linked ListRecursion |
| Substring with Concatenation of All Words | Hard | 34.0% | 37.5% | Hash TableStringSliding Window |
| Count and Say | Medium | 62.3% | 37.5% | String |
| Combination Sum II | Medium | 59.0% | 37.5% | ArrayBacktracking |
| Multiply Strings | Medium | 43.5% | 37.5% | MathStringSimulation |
| Wildcard Matching | Hard | 31.3% | 37.5% | StringDynamic ProgrammingGreedy+1 |
| Permutations II | Medium | 62.9% | 37.5% | ArrayBacktrackingSorting |
| Insert Interval | Medium | 44.7% | 37.5% | Array |
| Permutation Sequence | Hard | 52.1% | 37.5% | MathRecursion |
| Unique Paths II | Medium | 44.1% | 37.5% | ArrayDynamic ProgrammingMatrix |
| Text Justification | Hard | 50.4% | 37.5% | ArrayStringSimulation |
| Combinations | Medium | 74.2% | 37.5% | Backtracking |
| Search in Rotated Sorted Array II | Medium | 39.7% | 37.5% | ArrayBinary Search |
| Remove Duplicates from Sorted List | Easy | 56.2% | 37.5% | Linked List |
| Partition List | Medium | 60.6% | 37.5% | Linked ListTwo Pointers |
| Gray Code | Medium | 64.0% | 37.5% | MathBacktrackingBit Manipulation |
| Decode Ways | Medium | 37.6% | 37.5% | StringDynamic Programming |
| Binary Tree Inorder Traversal | Easy | 79.7% | 37.5% | StackTreeDepth-First Search+1 |
| Unique Binary Search Trees | Medium | 63.3% | 37.5% | MathDynamic ProgrammingTree+2 |
| Recover Binary Search Tree | Medium | 58.7% | 37.5% | TreeDepth-First SearchBinary Search Tree+1 |
| Same Tree | Easy | 66.6% | 37.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Convert Sorted Array to Binary Search Tree | Easy | 75.2% | 37.5% | ArrayDivide and ConquerTree+2 |
| Flatten Binary Tree to Linked List | Medium | 70.2% | 37.5% | Linked ListStackTree+2 |
| Distinct Subsequences | Hard | 51.5% | 37.5% | StringDynamic Programming |
| Triangle | Medium | 59.8% | 37.5% | ArrayDynamic Programming |
| Best Time to Buy and Sell Stock III | Hard | 53.1% | 37.5% | ArrayDynamic Programming |
| Clone Graph | Medium | 64.7% | 37.5% | Hash TableDepth-First SearchBreadth-First Search+1 |
| Single Number II | Medium | 66.7% | 37.5% | ArrayBit Manipulation |
| Linked List Cycle II | Medium | 57.2% | 37.5% | Hash TableLinked ListTwo Pointers |
| Compare Version Numbers | Medium | 46.1% | 37.5% | Two PointersString |
| Binary Search Tree Iterator | Medium | 76.1% | 37.5% | StackTreeDesign+3 |
| Rank Scores | Medium | 67.1% | 37.5% | Database |
| Consecutive Numbers | Medium | 47.8% | 37.5% | Database |
| Department Top Three Salaries | Hard | 59.8% | 37.5% | Database |
| Rising Temperature | Easy | 51.0% | 37.5% | Database |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 37.5% | Hash TableStringDesign+1 |
| Design Add and Search Words Data Structure | Medium | 48.1% | 37.5% | StringDepth-First SearchDesign+1 |
| House Robber II | Medium | 44.6% | 37.5% | ArrayDynamic Programming |
| Maximal Square | Medium | 50.0% | 37.5% | ArrayDynamic ProgrammingMatrix |
| Implement Stack using Queues | Easy | 69.3% | 37.5% | StackDesignQueue |
| Invert Binary Tree | Easy | 79.8% | 37.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Summary Ranges | Easy | 53.9% | 37.5% | Array |
| Majority Element II | Medium | 55.8% | 37.5% | ArrayHash TableSorting+1 |
| Power of Two | Easy | 49.8% | 37.5% | MathBit ManipulationRecursion |
| Implement Queue using Stacks | Easy | 69.3% | 37.5% | StackDesignQueue |
| Delete Node in a Linked List | Medium | 83.6% | 37.5% | Linked List |
| Different Ways to Add Parentheses | Medium | 73.1% | 37.5% | MathStringDynamic Programming+2 |
| Add Digits | Easy | 68.6% | 37.5% | MathSimulationNumber Theory |
| Alien Dictionary | Hard | 37.1% | 37.5% | |
| H-Index | Medium | 41.1% | 37.5% | ArraySortingCounting Sort |
| First Bad Version | Easy | 46.8% | 37.5% | Binary SearchInteractive |
| Range Sum Query - Immutable | Easy | 71.4% | 37.5% | ArrayDesignPrefix Sum |
| Burst Balloons | Hard | 62.9% | 37.5% | ArrayDynamic Programming |
| Remove Duplicate Letters | Medium | 52.8% | 37.5% | StringStackGreedy+1 |
| Number of Connected Components in an Undirected Graph | Medium | 64.8% | 37.5% | |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 37.5% | ArrayDynamic ProgrammingDepth-First Search+5 |
| Reconstruct Itinerary | Hard | 44.3% | 37.5% | ArrayStringDepth-First Search+4 |
| Increasing Triplet Subsequence | Medium | 39.2% | 37.5% | ArrayGreedy |
| House Robber III | Medium | 55.6% | 37.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Reverse Vowels of a String | Easy | 60.6% | 37.5% | Two PointersString |
| Design Tic-Tac-Toe | Medium | 58.7% | 37.5% | |
| Russian Doll Envelopes | Hard | 37.7% | 37.5% | ArrayBinary SearchDynamic Programming+1 |
| Design Twitter | Medium | 44.2% | 37.5% | Hash TableLinked ListDesign+1 |
| Sum of Two Integers | Medium | 55.0% | 37.5% | MathBit Manipulation |
| Find K Pairs with Smallest Sums | Medium | 41.5% | 37.5% | ArrayHeap (Priority Queue) |
| Kth Smallest Element in a Sorted Matrix | Medium | 64.4% | 37.5% | ArrayBinary SearchSorting+2 |
| Ransom Note | Easy | 65.6% | 37.5% | Hash TableStringCounting |
| Find the Difference | Easy | 60.1% | 37.5% | Hash TableStringBit Manipulation+1 |
| Is Subsequence | Easy | 48.8% | 37.5% | Two PointersStringDynamic Programming |
| Longest Substring with At Least K Repeating Characters | Medium | 46.0% | 37.5% | Hash TableStringDivide and Conquer+1 |
| Trapping Rain Water II | Hard | 64.0% | 37.5% | ArrayBreadth-First SearchHeap (Priority Queue)+1 |
| Pacific Atlantic Water Flow | Medium | 60.6% | 37.5% | ArrayDepth-First SearchBreadth-First Search+1 |
| All O`one Data Structure | Hard | 44.1% | 37.5% | Hash TableLinked ListDesign+1 |
| Non-overlapping Intervals | Medium | 56.7% | 37.5% | ArrayDynamic ProgrammingGreedy+1 |
| Path Sum III | Medium | 46.3% | 37.5% | TreeDepth-First SearchBinary Tree |
| Find All Duplicates in an Array | Medium | 76.8% | 37.5% | ArrayHash TableSorting |
| Find All Numbers Disappeared in an Array | Easy | 63.7% | 37.5% | ArrayHash Table |
| Delete Node in a BST | Medium | 54.2% | 37.5% | TreeBinary Search TreeBinary Tree |
| Sort Characters By Frequency | Medium | 75.1% | 37.5% | Hash TableStringSorting+3 |
| Assign Cookies | Easy | 54.7% | 37.5% | ArrayTwo PointersGreedy+1 |
| Repeated Substring Pattern | Easy | 47.8% | 37.5% | StringString Matching |
| Predict the Winner | Medium | 56.1% | 37.5% | ArrayMathDynamic Programming+2 |
| Reverse Pairs | Hard | 33.7% | 37.5% | ArrayBinary SearchDivide and Conquer+4 |
| Diagonal Traverse | Medium | 67.0% | 37.5% | ArrayMatrixSimulation |
| Longest Palindromic Subsequence | Medium | 65.1% | 37.5% | StringDynamic Programming |
| Coin Change II | Medium | 60.5% | 37.5% | ArrayDynamic Programming |
| Continuous Subarray Sum | Medium | 31.2% | 37.5% | ArrayHash TableMath+1 |
| Swapping Nodes in a Linked List | Medium | 69.2% | 37.5% | Linked ListTwo Pointers |
| K-diff Pairs in an Array | Medium | 45.6% | 37.5% | ArrayHash TableTwo Pointers+2 |
| 01 Matrix | Medium | 53.3% | 37.5% | ArrayDynamic ProgrammingBreadth-First Search+1 |
| Boundary of Binary Tree | Medium | 47.9% | 37.5% | |
| Next Greater Element III | Medium | 35.1% | 37.5% | MathTwo PointersString |
| Employee Bonus | Easy | 77.1% | 37.5% | Database |
| Find Customer Referee | Easy | 72.6% | 37.5% | Database |
| Design In-Memory File System | Hard | 48.4% | 37.5% | |
| Big Countries | Easy | 68.4% | 37.5% | Database |
| Can Place Flowers | Easy | 29.0% | 37.5% | ArrayGreedy |
| Merge Two Binary Trees | Easy | 79.0% | 37.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Smallest Range Covering Elements from K Lists | Hard | 70.0% | 37.5% | ArrayHash TableGreedy+3 |
| Exclusive Time of Functions | Medium | 66.1% | 37.5% | ArrayStack |
| Maximum Average Subarray I | Easy | 47.0% | 37.5% | ArraySliding Window |
| Set Mismatch | Easy | 44.2% | 37.5% | ArrayHash TableBit Manipulation+1 |
| Palindromic Substrings | Medium | 72.5% | 37.5% | Two PointersStringDynamic Programming |
| Two Sum IV - Input is a BST | Easy | 63.0% | 37.5% | Hash TableTwo PointersTree+4 |
| Valid Parenthesis String | Medium | 39.8% | 37.5% | StringDynamic ProgrammingStack+1 |
| Valid Palindrome II | Easy | 44.0% | 37.5% | Two PointersStringGreedy |
| Number of Distinct Islands | Medium | 62.7% | 37.5% | |
| Max Area of Island | Medium | 73.8% | 37.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Count Binary Substrings | Easy | 70.2% | 37.5% | Two PointersString |
| Subarray Product Less Than K | Medium | 53.9% | 37.5% | ArrayBinary SearchSliding Window+1 |
| Accounts Merge | Medium | 60.9% | 37.5% | ArrayHash TableString+4 |
| Find Pivot Index | Easy | 62.1% | 37.5% | ArrayPrefix Sum |
| Split Linked List in Parts | Medium | 70.5% | 37.5% | Linked List |
| Min Cost Climbing Stairs | Easy | 68.0% | 37.5% | ArrayDynamic Programming |
| Open the Lock | Medium | 61.1% | 37.5% | ArrayHash TableString+1 |
| Partition Labels | Medium | 81.8% | 37.5% | Hash TableTwo PointersString+1 |
| Jewels and Stones | Easy | 89.5% | 37.5% | Hash TableString |
| Binary Search | Easy | 60.5% | 37.5% | ArrayBinary Search |
| Is Graph Bipartite? | Medium | 58.9% | 37.5% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Cheapest Flights Within K Stops | Medium | 41.4% | 37.5% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+3 |
| Domino and Tromino Tiling | Medium | 51.4% | 37.5% | Dynamic Programming |
| Custom Sort String | Medium | 72.3% | 37.5% | Hash TableStringSorting |
| Rotate String | Easy | 65.1% | 37.5% | StringString Matching |
| Design HashMap | Easy | 66.4% | 37.5% | ArrayHash TableLinked List+2 |
| Find Eventual Safe States | Medium | 70.3% | 37.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Bus Routes | Hard | 47.1% | 37.5% | ArrayHash TableBreadth-First Search |
| Making A Large Island | Hard | 56.3% | 37.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Design Circular Queue | Medium | 54.0% | 37.5% | ArrayLinked ListDesign+1 |
| Boats to Save People | Medium | 61.4% | 37.5% | ArrayTwo PointersGreedy+1 |
| Online Stock Span | Medium | 68.7% | 37.5% | StackDesignMonotonic Stack+1 |
| Snakes and Ladders | Medium | 48.0% | 37.5% | ArrayBreadth-First SearchMatrix |
| Minimum Add to Make Parentheses Valid | Medium | 74.4% | 37.5% | StringStackGreedy |
| Sort Array By Parity II | Easy | 71.2% | 37.5% | ArrayTwo PointersSorting |
| Binary Subarrays With Sum | Medium | 68.2% | 37.5% | ArrayHash TableSliding Window+1 |
| Minimum Falling Path Sum | Medium | 60.8% | 37.5% | ArrayDynamic ProgrammingMatrix |
| Reorder Data in Log Files | Medium | 56.9% | 37.5% | ArrayStringSorting |
| Reveal Cards In Increasing Order | Medium | 83.5% | 37.5% | ArrayQueueSorting+1 |
| Maximum Width Ramp | Medium | 55.8% | 37.5% | ArrayTwo PointersStack+1 |
| Binary Tree Cameras | Hard | 47.6% | 37.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Squares of a Sorted Array | Easy | 73.6% | 37.5% | ArrayTwo PointersSorting |
| Longest Duplicate Substring | Hard | 31.1% | 37.5% | StringBinary SearchSliding Window+3 |
| Remove All Adjacent Duplicates In String | Easy | 72.8% | 37.5% | StringStack |
| Customers Who Bought All Products | Medium | 63.7% | 37.5% | Database |
| Greatest Common Divisor of Strings | Easy | 53.4% | 37.5% | MathString |
| Product Sales Analysis I | Easy | 85.6% | 37.5% | Database |
| Product Sales Analysis III | Medium | 45.6% | 37.5% | Database |
| Smallest Subsequence of Distinct Characters | Medium | 63.1% | 37.5% | StringStackGreedy+1 |
| Shortest Path in Binary Matrix | Medium | 51.1% | 37.5% | ArrayBreadth-First SearchMatrix |
| Number of Equivalent Domino Pairs | Easy | 60.6% | 37.5% | ArrayHash TableCounting |
| Replace Elements with Greatest Element on Right Side | Easy | 72.0% | 37.5% | Array |
| Longest Common Subsequence | Medium | 58.9% | 37.5% | StringDynamic Programming |
| Balance a Binary Search Tree | Medium | 86.3% | 37.5% | Divide and ConquerGreedyTree+3 |
| Immediate Food Delivery II | Medium | 55.6% | 37.5% | Database |
| Critical Connections in a Network | Hard | 59.3% | 37.5% | Depth-First SearchGraph TheoryBiconnected Component |
| Monthly Transactions I | Medium | 58.9% | 37.5% | Database |
| Unique Number of Occurrences | Easy | 78.6% | 37.5% | ArrayHash Table |
| Remove All Adjacent Duplicates in String II | Medium | 60.9% | 37.5% | StringStack |
| First Unique Number | Medium | 57.0% | 37.5% | |
| Average Selling Price | Easy | 37.1% | 37.5% | Database |
| Find the Smallest Divisor Given a Threshold | Medium | 65.4% | 37.5% | ArrayBinary Search |
| List the Products Ordered in a Period | Easy | 71.6% | 37.5% | Database |
| Maximum Sum BST in Binary Tree | Hard | 46.4% | 37.5% | Dynamic ProgrammingTreeDepth-First Search+2 |
| Count Negative Numbers in a Sorted Matrix | Easy | 79.5% | 37.5% | ArrayBinary SearchMatrix |
| Maximum Number of Events That Can Be Attended | Medium | 38.9% | 37.5% | ArrayGreedySorting+1 |
| Replace Employee ID With The Unique Identifier | Easy | 83.5% | 37.5% | Database |
| Kids With the Greatest Number of Candies | Easy | 88.0% | 37.5% | Array |
| Maximum Points You Can Obtain from Cards | Medium | 57.2% | 37.5% | ArraySliding WindowPrefix Sum |
| Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | 57.3% | 37.5% | ArrayQueueSliding Window+3 |
| Maximum Number of Vowels in a Substring of Given Length | Medium | 61.5% | 37.5% | StringSliding Window |
| Running Sum of 1d Array | Easy | 86.9% | 37.5% | ArrayPrefix Sum |
| Minimum Number of Days to Make m Bouquets | Medium | 56.2% | 37.5% | ArrayBinary Search |
| Path Crossing | Easy | 62.6% | 37.5% | Hash TableString |
| Clone Binary Tree With Random Pointer | Medium | 80.9% | 37.5% | |
| Kth Missing Positive Number | Easy | 63.2% | 37.5% | ArrayBinary Search |
| Make Sum Divisible by P | Medium | 42.6% | 37.5% | ArrayHash TablePrefix Sum |
| Design Parking System | Easy | 87.1% | 37.5% | DesignSimulationCounting |
| Customer Who Visited but Did Not Make Any Transactions | Easy | 67.6% | 37.5% | Database |
| Furthest Building You Can Reach | Medium | 50.7% | 37.5% | ArrayGreedyHeap (Priority Queue) |
| Number of Students Unable to Eat Lunch | Easy | 79.3% | 37.5% | ArrayStackQueue+1 |
| Find Minimum Time to Finish All Jobs | Hard | 45.3% | 37.5% | ArrayDynamic ProgrammingBacktracking+2 |
| Maximum Units on a Truck | Easy | 74.6% | 37.5% | ArrayGreedySorting |
| Sum of Beauty of All Substrings | Medium | 73.5% | 37.5% | Hash TableStringCounting |
| Maximum Average Pass Ratio | Medium | 74.1% | 37.5% | ArrayGreedyHeap (Priority Queue) |
| Frequency of the Most Frequent Element | Medium | 44.6% | 37.5% | ArrayBinary SearchGreedy+3 |
| Sum of All Subset XOR Totals | Easy | 90.1% | 37.5% | ArrayMathBacktracking+3 |
| Count Good Numbers | Medium | 57.4% | 37.5% | MathRecursion |
| The Number of the Smallest Unoccupied Chair | Medium | 60.4% | 37.5% | ArrayHash TableHeap (Priority Queue) |
| Concatenation of Array | Easy | 90.5% | 37.5% | ArraySimulation |
| Confirmation Rate | Medium | 61.6% | 37.5% | Database |
| Sum of Subarray Ranges | Medium | 60.7% | 37.5% | ArrayStackMonotonic Stack |
| Minimum Swaps to Group All 1's Together II | Medium | 65.6% | 37.5% | ArraySliding Window |
| Find Triangular Sum of an Array | Medium | 82.0% | 37.5% | ArrayMathSimulation+2 |
| Count Number of Rectangles Containing Each Point | Medium | 37.4% | 37.5% | ArrayHash TableBinary Search+2 |
| Sum of Total Strength of Wizards | Hard | 29.1% | 37.5% | ArrayStackMonotonic Stack+1 |
| Apply Discount to Prices | Medium | 33.8% | 37.5% | String |
| Add Two Integers | Easy | 87.9% | 37.5% | Math |
| Minimum Number of Keypresses | Medium | 71.4% | 37.5% | |
| Best Poker Hand | Easy | 61.6% | 37.5% | ArrayHash TableCounting |
| Amount of Time for Binary Tree to Be Infected | Medium | 65.1% | 37.5% | Hash TableTreeDepth-First Search+2 |
| Removing Stars From a String | Medium | 78.9% | 37.5% | StringStackSimulation |
| Max Sum of a Pair With Equal Sum of Digits | Medium | 66.0% | 37.5% | ArrayHash TableSorting+1 |
| Maximum Number of Books You Can Take | Hard | 39.5% | 37.5% | |
| Using a Robot to Print the Lexicographically Smallest String | Medium | 62.5% | 37.5% | Hash TableStringStack+1 |
| Maximum Sum of Distinct Subarrays With Length K | Medium | 42.8% | 37.5% | ArrayHash TableSliding Window |
| Put Marbles in Bags | Hard | 72.2% | 37.5% | ArrayGreedySorting+1 |
| To Be Or Not To Be | Easy | 63.3% | 37.5% | |
| Length of the Longest Valid Substring | Hard | 38.2% | 37.5% | ArrayHash TableString+1 |
| Make String a Subsequence Using Cyclic Increments | Medium | 65.7% | 37.5% | Two PointersString |
| Create a DataFrame from List | Easy | 81.1% | 37.5% | |
| Minimum Number of Operations to Make Array Empty | Medium | 62.1% | 37.5% | ArrayHash TableGreedy+1 |
| Distribute Candies Among Children II | Medium | 55.7% | 37.5% | MathCombinatoricsEnumeration |
| Find Missing and Repeated Values | Easy | 83.3% | 37.5% | ArrayHash TableMath+1 |
| Most Expensive Item That Can Not Be Bought | Medium | 80.3% | 37.5% | |
| Minimum Number of Pushes to Type Word II | Medium | 80.0% | 37.5% | Hash TableStringGreedy+2 |
| Find Longest Self-Contained Substring | Hard | 58.8% | 37.5% | |
| Find the Number of Possible Ways for an Event | Hard | 34.8% | 37.5% | MathDynamic ProgrammingCombinatorics |
| Count Square Submatrices with All Ones | Medium | 80.7% | 37.5% | ArrayDynamic ProgrammingMatrix |
| Minimum Difference in Sums After Removal of Elements | Hard | 69.9% | 37.5% | ArrayDynamic ProgrammingHeap (Priority Queue) |
| Maximum Number of Groups With Increasing Length | Hard | 23.0% | 37.5% | ArrayMathBinary Search+2 |
| Minimum Number of Primes to Sum to Target | Medium | 59.6% | 37.5% | |
| Process String with Special Operations I | Medium | 64.9% | 37.5% | StringSimulation |
| Maximum K to Sort a Permutation | Medium | 37.2% | 37.5% | ArrayBit Manipulation |
| Lexicographically Smallest Negated Permutation that Sums to Target | Medium | 30.7% | 37.5% | ArrayMathTwo Pointers+2 |
| N-Queens II | Hard | 78.1% | 25.0% | Backtracking |
| Spiral Matrix II | Medium | 74.6% | 25.0% | ArrayMatrixSimulation |
| Valid Number | Hard | 22.6% | 25.0% | String |
| Scramble String | Hard | 43.9% | 25.0% | StringDynamic Programming |
| Restore IP Addresses | Medium | 55.3% | 25.0% | StringBacktracking |
| Unique Binary Search Trees II | Medium | 61.9% | 25.0% | Dynamic ProgrammingBacktrackingTree+2 |
| Interleaving String | Medium | 43.5% | 25.0% | StringDynamic Programming |
| Construct Binary Tree from Inorder and Postorder Traversal | Medium | 68.0% | 25.0% | ArrayHash TableDivide and Conquer+2 |
| Path Sum | Easy | 54.4% | 25.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Path Sum II | Medium | 61.7% | 25.0% | BacktrackingTreeDepth-First Search+1 |
| Populating Next Right Pointers in Each Node II | Medium | 57.1% | 25.0% | Linked ListTreeDepth-First Search+2 |
| Pascal's Triangle II | Easy | 67.1% | 25.0% | ArrayDynamic Programming |
| Sum Root to Leaf Numbers | Medium | 69.6% | 25.0% | TreeDepth-First SearchBinary Tree |
| Palindrome Partitioning II | Hard | 36.6% | 25.0% | StringDynamic Programming |
| Binary Tree Postorder Traversal | Easy | 77.6% | 25.0% | StackTreeDepth-First Search+1 |
| Max Points on a Line | Hard | 30.2% | 25.0% | ArrayHash TableMath+1 |
| Excel Sheet Column Title | Easy | 45.7% | 25.0% | MathString |
| Excel Sheet Column Number | Easy | 67.2% | 25.0% | MathString |
| Dungeon Game | Hard | 40.8% | 25.0% | ArrayDynamic ProgrammingMatrix |
| Nth Highest Salary | Medium | 38.8% | 25.0% | Database |
| Duplicate Emails | Easy | 73.4% | 25.0% | Database |
| Customers Who Never Order | Easy | 71.5% | 25.0% | Database |
| Department Highest Salary | Medium | 57.3% | 25.0% | Database |
| Reverse Words in a String II | Medium | 56.6% | 25.0% | |
| Repeated DNA Sequences | Medium | 52.9% | 25.0% | Hash TableStringBit Manipulation+3 |
| Best Time to Buy and Sell Stock IV | Hard | 49.5% | 25.0% | ArrayDynamic Programming |
| Reverse Bits | Easy | 67.7% | 25.0% | Divide and ConquerBit Manipulation |
| Number of 1 Bits | Easy | 76.3% | 25.0% | Divide and ConquerBit Manipulation |
| Delete Duplicate Emails | Easy | 65.6% | 25.0% | Database |
| Remove Linked List Elements | Easy | 53.8% | 25.0% | Linked ListRecursion |
| Shortest Palindrome | Hard | 41.8% | 25.0% | StringRolling HashString Matching+1 |
| Combination Sum III | Medium | 72.9% | 25.0% | ArrayBacktracking |
| The Skyline Problem | Hard | 45.0% | 25.0% | ArrayDivide and ConquerBinary Indexed Tree+5 |
| Number of Digit One | Hard | 37.7% | 25.0% | MathDynamic ProgrammingRecursion |
| Meeting Rooms | Easy | 59.3% | 25.0% | |
| Single Number III | Medium | 70.4% | 25.0% | ArrayBit Manipulation |
| Trips and Users | Hard | 37.7% | 25.0% | Database |
| Ugly Number | Easy | 43.1% | 25.0% | Math |
| Ugly Number II | Medium | 49.5% | 25.0% | Hash TableMathDynamic Programming+1 |
| Encode and Decode Strings | Medium | 51.2% | 25.0% | |
| Find the Celebrity | Medium | 48.9% | 25.0% | |
| Perfect Squares | Medium | 56.3% | 25.0% | MathDynamic ProgrammingBreadth-First Search |
| Walls and Gates | Medium | 63.8% | 25.0% | |
| Game of Life | Medium | 72.3% | 25.0% | ArrayMatrixSimulation |
| Word Pattern | Easy | 43.8% | 25.0% | Hash TableString |
| Bulls and Cows | Medium | 52.2% | 25.0% | Hash TableStringCounting |
| Range Sum Query 2D - Immutable | Medium | 57.8% | 25.0% | ArrayDesignMatrix+1 |
| Minimum Height Trees | Medium | 42.4% | 25.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Binary Tree Vertical Order Traversal | Medium | 57.7% | 25.0% | |
| Count of Smaller Numbers After Self | Hard | 43.3% | 25.0% | ArrayBinary SearchDivide and Conquer+4 |
| Shortest Distance from All Buildings | Hard | 44.8% | 25.0% | |
| Bulb Switcher | Medium | 55.5% | 25.0% | MathBrainteaser |
| Power of Three | Easy | 50.7% | 25.0% | MathRecursion |
| Counting Bits | Easy | 80.4% | 25.0% | Dynamic ProgrammingBit Manipulation |
| Nested List Weight Sum | Medium | 85.9% | 25.0% | |
| Longest Substring with At Most K Distinct Characters | Medium | 49.9% | 25.0% | |
| Flatten Nested List Iterator | Medium | 65.6% | 25.0% | StackTreeDepth-First Search+3 |
| Power of Four | Easy | 51.7% | 25.0% | MathBit ManipulationRecursion |
| Moving Average from Data Stream | Easy | 80.2% | 25.0% | |
| Logger Rate Limiter | Easy | 76.8% | 25.0% | |
| Design Hit Counter | Medium | 69.6% | 25.0% | |
| Largest Divisible Subset | Medium | 49.4% | 25.0% | ArrayMathDynamic Programming+1 |
| Insert Delete GetRandom O(1) - Duplicates allowed | Hard | 36.4% | 25.0% | ArrayHash TableMath+2 |
| Lexicographical Numbers | Medium | 76.2% | 25.0% | Depth-First SearchTrie |
| Rotate Function | Medium | 45.4% | 25.0% | ArrayMathDynamic Programming |
| Frog Jump | Hard | 47.1% | 25.0% | ArrayDynamic Programming |
| Sum of Left Leaves | Easy | 62.4% | 25.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Valid Word Abbreviation | Easy | 37.0% | 25.0% | |
| Longest Palindrome | Easy | 55.8% | 25.0% | Hash TableStringGreedy |
| Third Maximum Number | Easy | 38.8% | 25.0% | ArraySorting |
| Add Strings | Easy | 52.1% | 25.0% | MathStringSimulation |
| Battleships in a Board | Medium | 77.3% | 25.0% | ArrayDepth-First SearchMatrix |
| Minimum Genetic Mutation | Medium | 56.4% | 25.0% | Hash TableStringBreadth-First Search |
| Arranging Coins | Easy | 48.0% | 25.0% | MathBinary Search |
| Add Two Numbers II | Medium | 62.4% | 25.0% | Linked ListMathStack |
| Serialize and Deserialize BST | Medium | 59.3% | 25.0% | StringTreeDepth-First Search+4 |
| Minimum Number of Arrows to Burst Balloons | Medium | 61.2% | 25.0% | ArrayGreedySorting |
| 132 Pattern | Medium | 34.5% | 25.0% | ArrayBinary SearchStack+2 |
| Island Perimeter | Easy | 74.2% | 25.0% | ArrayDepth-First SearchBreadth-First Search+1 |
| Optimal Account Balancing | Hard | 50.3% | 25.0% | |
| Heaters | Medium | 41.4% | 25.0% | ArrayTwo PointersBinary Search+1 |
| Sliding Window Median | Hard | 38.9% | 25.0% | ArrayHash TableSliding Window+1 |
| IPO | Hard | 53.3% | 25.0% | ArrayGreedySorting+1 |
| Base 7 | Easy | 53.8% | 25.0% | MathString |
| Most Frequent Subtree Sum | Medium | 68.9% | 25.0% | Hash TableTreeDepth-First Search+1 |
| Maximum Alternating Subarray Sum | Medium | 40.0% | 25.0% | |
| Super Washing Machines | Hard | 43.8% | 25.0% | ArrayGreedy |
| Minesweeper | Medium | 68.7% | 25.0% | ArrayDepth-First SearchBreadth-First Search+1 |
| Encode and Decode TinyURL | Medium | 86.6% | 25.0% | Hash TableStringDesign+1 |
| Construct Binary Tree from String | Medium | 58.7% | 25.0% | |
| Complex Number Multiplication | Medium | 73.2% | 25.0% | MathStringSimulation |
| Convert BST to Greater Tree | Medium | 71.4% | 25.0% | TreeDepth-First SearchBinary Search Tree+1 |
| Minimum Time Difference | Medium | 62.5% | 25.0% | ArrayMathString+1 |
| Optimal Division | Medium | 62.7% | 25.0% | ArrayMathDynamic Programming |
| Reverse Words in a String III | Easy | 83.9% | 25.0% | Two PointersString |
| Array Partition | Easy | 81.5% | 25.0% | ArrayGreedySorting+1 |
| Find the Closest Palindrome | Hard | 31.8% | 25.0% | MathString |
| Subtree of Another Tree | Easy | 51.2% | 25.0% | TreeDepth-First SearchString Matching+2 |
| Find Cumulative Salary of an Employee | Hard | 49.3% | 25.0% | |
| Shortest Unsorted Continuous Subarray | Medium | 38.0% | 25.0% | ArrayTwo PointersStack+3 |
| Longest Harmonious Subsequence | Easy | 64.4% | 25.0% | ArrayHash TableSliding Window+2 |
| Construct String from Binary Tree | Medium | 70.6% | 25.0% | StringTreeDepth-First Search+1 |
| Triangle Judgement | Easy | 74.5% | 25.0% | Database |
| Valid Triangle Number | Medium | 56.7% | 25.0% | ArrayTwo PointersBinary Search+2 |
| Exchange Seats | Medium | 73.8% | 25.0% | Database |
| Maximum Product of Three Numbers | Easy | 45.7% | 25.0% | ArrayMathSorting |
| Course Schedule III | Hard | 41.4% | 25.0% | ArrayGreedySorting+1 |
| Sum of Square Numbers | Medium | 36.7% | 25.0% | MathTwo PointersBinary Search |
| Solve the Equation | Medium | 46.0% | 25.0% | MathStringSimulation |
| Design Search Autocomplete System | Hard | 49.7% | 25.0% | |
| Maximum Length of Pair Chain | Medium | 61.5% | 25.0% | ArrayDynamic ProgrammingGreedy+1 |
| 2 Keys Keyboard | Medium | 59.3% | 25.0% | MathDynamic Programming |
| Image Smoother | Easy | 69.1% | 25.0% | ArrayMatrix |
| Equal Tree Partition | Medium | 42.3% | 25.0% | |
| Maximum Swap | Medium | 51.9% | 25.0% | MathGreedy |
| Cut Off Trees for Golf Event | Hard | 36.1% | 25.0% | ArrayBreadth-First SearchHeap (Priority Queue)+1 |
| Baseball Game | Easy | 80.0% | 25.0% | ArrayStackSimulation |
| Redundant Connection | Medium | 67.2% | 25.0% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Partition to K Equal Sum Subsets | Medium | 38.4% | 25.0% | ArrayDynamic ProgrammingBacktracking+3 |
| Number of Distinct Islands II | Hard | 55.3% | 25.0% | |
| Max Stack | Hard | 45.9% | 25.0% | |
| Find K-th Smallest Pair Distance | Hard | 46.3% | 25.0% | ArrayTwo PointersBinary Search+1 |
| My Calendar I | Medium | 58.2% | 25.0% | ArrayBinary SearchDesign+2 |
| Monotone Increasing Digits | Medium | 49.4% | 25.0% | MathGreedy |
| Delete and Earn | Medium | 57.1% | 25.0% | ArrayHash TableDynamic Programming |
| Closest Leaf in a Binary Tree | Medium | 47.4% | 25.0% | |
| Network Delay Time | Medium | 59.7% | 25.0% | Depth-First SearchBreadth-First SearchGraph Theory+2 |
| Serialize and Deserialize N-ary Tree | Hard | 68.6% | 25.0% | |
| Flatten a Multilevel Doubly Linked List | Medium | 62.5% | 25.0% | Linked ListDepth-First SearchDoubly-Linked List |
| Prime Number of Set Bits in Binary Representation | Easy | 72.4% | 25.0% | MathBit Manipulation |
| Search in a Binary Search Tree | Easy | 82.5% | 25.0% | TreeBinary Search TreeBinary Tree |
| Insert into a Binary Search Tree | Medium | 73.3% | 25.0% | TreeBinary Search TreeBinary Tree |
| Basic Calculator III | Hard | 53.1% | 25.0% | |
| Global and Local Inversions | Medium | 42.7% | 25.0% | ArrayMath |
| Split BST | Medium | 82.2% | 25.0% | |
| Swim in Rising Water | Hard | 67.6% | 25.0% | ArrayBinary SearchDepth-First Search+4 |
| K-th Symbol in Grammar | Medium | 48.1% | 25.0% | MathBit ManipulationRecursion |
| All Paths From Source to Target | Medium | 83.5% | 25.0% | BacktrackingDepth-First SearchBreadth-First Search+1 |
| Minimum Swaps To Make Sequences Increasing | Hard | 41.3% | 25.0% | ArrayDynamic Programming |
| Most Common Word | Easy | 45.0% | 25.0% | ArrayHash TableString+1 |
| Design Linked List | Medium | 29.8% | 25.0% | Linked ListDesign |
| Most Profit Assigning Work | Medium | 56.1% | 25.0% | ArrayTwo PointersBinary Search+2 |
| Keys and Rooms | Medium | 75.5% | 25.0% | Depth-First SearchBreadth-First SearchGraph Theory |
| Split Array into Fibonacci Sequence | Medium | 40.2% | 25.0% | StringBacktracking |
| Guess the Word | Hard | 36.9% | 25.0% | ArrayMathString+2 |
| Backspace String Compare | Easy | 49.8% | 25.0% | Two PointersStringStack+1 |
| Loud and Rich | Medium | 63.2% | 25.0% | ArrayDepth-First SearchGraph Theory+1 |
| Car Fleet | Medium | 54.7% | 25.0% | ArrayStackSorting+1 |
| Minimum Cost to Hire K Workers | Hard | 63.6% | 25.0% | ArrayGreedySorting+1 |
| Lemonade Change | Easy | 58.9% | 25.0% | ArrayGreedy |
| Shortest Subarray with Sum at Least K | Hard | 32.6% | 25.0% | ArrayBinary SearchQueue+4 |
| Transpose Matrix | Easy | 75.9% | 25.0% | ArrayMatrixSimulation |
| Reordered Power of 2 | Medium | 66.0% | 25.0% | Hash TableMathSorting+2 |
| Minimum Number of Refueling Stops | Hard | 41.1% | 25.0% | ArrayDynamic ProgrammingGreedy+1 |
| Nth Magical Number | Hard | 36.4% | 25.0% | MathBinary Search |
| Find and Replace Pattern | Medium | 77.0% | 25.0% | ArrayHash TableString |
| Maximum Frequency Stack | Hard | 66.6% | 25.0% | Hash TableStackDesign+1 |
| Orderly Queue | Hard | 66.7% | 25.0% | MathStringSorting |
| Numbers At Most N Given Digit Set | Hard | 44.5% | 25.0% | ArrayMathString+2 |
| Maximum Sum Circular Subarray | Medium | 49.4% | 25.0% | ArrayDivide and ConquerDynamic Programming+2 |
| Flip String to Monotone Increasing | Medium | 61.8% | 25.0% | StringDynamic Programming |
| Number of Recent Calls | Easy | 78.1% | 25.0% | DesignQueueData Stream |
| Shortest Bridge | Medium | 59.3% | 25.0% | ArrayDepth-First SearchBreadth-First Search+1 |
| Valid Mountain Array | Easy | 35.0% | 25.0% | Array |
| Minimum Increment to Make Array Unique | Medium | 60.6% | 25.0% | ArrayGreedySorting+1 |
| Most Stones Removed with Same Row or Column | Medium | 62.7% | 25.0% | Hash TableDepth-First SearchUnion-Find+1 |
| Prison Cells After N Days | Medium | 39.1% | 25.0% | ArrayHash TableMath+1 |
| Regions Cut By Slashes | Medium | 77.5% | 25.0% | ArrayHash TableDepth-First Search+3 |
| Subarray Sums Divisible by K | Medium | 56.0% | 25.0% | ArrayHash TablePrefix Sum |
| Distribute Coins in Binary Tree | Medium | 77.2% | 25.0% | TreeDepth-First SearchBinary Tree |
| Unique Paths III | Hard | 82.7% | 25.0% | ArrayBacktrackingBit Manipulation+1 |
| Minimum Cost For Tickets | Medium | 67.4% | 25.0% | ArrayDynamic Programming |
| Interval List Intersections | Medium | 72.9% | 25.0% | ArrayTwo PointersSweep Line |
| Find the Town Judge | Easy | 50.5% | 25.0% | ArrayHash TableGraph Theory |
| Minimum Cost to Merge Stones | Hard | 45.6% | 25.0% | ArrayDynamic ProgrammingPrefix Sum |
| Find Common Characters | Easy | 74.6% | 25.0% | ArrayHash TableString |
| Construct Binary Search Tree from Preorder Traversal | Medium | 84.1% | 25.0% | ArrayStackTree+3 |
| Pairs of Songs With Total Durations Divisible by 60 | Medium | 53.4% | 25.0% | ArrayHash TableCounting |
| Missing Element in Sorted Array | Medium | 59.7% | 25.0% | |
| Longest Repeating Substring | Medium | 63.4% | 25.0% | |
| Digit Count in Range | Hard | 46.4% | 25.0% | |
| High Five | Easy | 74.2% | 25.0% | |
| Index Pairs of a String | Easy | 68.7% | 25.0% | |
| Remove Outermost Parentheses | Easy | 86.8% | 25.0% | StringStack |
| Sum of Root To Leaf Binary Numbers | Easy | 73.7% | 25.0% | TreeDepth-First SearchBinary Tree |
| Sum of Digits in the Minimum Number | Easy | 76.7% | 25.0% | |
| Two Sum Less Than K | Easy | 62.1% | 25.0% | |
| Find K-Length Substrings With No Repeated Characters | Medium | 76.5% | 25.0% | |
| Number of Days in a Month | Easy | 59.3% | 25.0% | |
| Remove Vowels from a String | Easy | 91.3% | 25.0% | |
| Armstrong Number | Easy | 77.8% | 25.0% | |
| Maximum Average Subtree | Medium | 66.9% | 25.0% | |
| Maximum Difference Between Node and Ancestor | Medium | 78.1% | 25.0% | TreeDepth-First SearchBinary Tree |
| Recover a Tree From Preorder Traversal | Hard | 83.2% | 25.0% | StringTreeDepth-First Search+1 |
| Largest Unique Number | Easy | 71.3% | 25.0% | |
| Path With Maximum Minimum Value | Medium | 54.6% | 25.0% | |
| Connecting Cities With Minimum Cost | Medium | 63.4% | 25.0% | |
| Uncrossed Lines | Medium | 65.0% | 25.0% | ArrayDynamic Programming |
| Find Words That Can Be Formed by Characters | Easy | 71.5% | 25.0% | ArrayHash TableString+1 |
| Binary Search Tree to Greater Sum Tree | Medium | 88.4% | 25.0% | TreeDepth-First SearchBinary Search Tree+1 |
| Maximum Level Sum of a Binary Tree | Medium | 70.0% | 25.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Robot Bounded In Circle | Medium | 56.4% | 25.0% | MathStringSimulation |
| Design File System | Medium | 65.1% | 25.0% | |
| Minimum Cost to Connect Sticks | Medium | 71.8% | 25.0% | |
| Last Stone Weight | Easy | 66.3% | 25.0% | ArrayHeap (Priority Queue) |
| Actors and Directors Who Cooperated At Least Three Times | Easy | 70.9% | 25.0% | Database |
| Grumpy Bookstore Owner | Medium | 64.0% | 25.0% | ArraySliding Window |
| Distant Barcodes | Medium | 48.6% | 25.0% | ArrayHash TableGreedy+3 |
| Number of Submatrices That Sum to Target | Hard | 74.6% | 25.0% | ArrayHash TableMatrix+1 |
| Two Sum BSTs | Medium | 68.1% | 25.0% | |
| Product Sales Analysis II | Easy | 82.6% | 25.0% | |
| Insufficient Nodes in Root to Leaf Paths | Medium | 54.8% | 25.0% | TreeDepth-First SearchBinary Tree |
| Shortest Common Supersequence | Hard | 61.7% | 25.0% | StringDynamic Programming |
| Sales Analysis I | Easy | 74.8% | 25.0% | |
| Sales Analysis II | Easy | 50.1% | 25.0% | |
| Sales Analysis III | Easy | 47.2% | 25.0% | Database |
| Game Play Analysis IV | Medium | 40.7% | 25.0% | Database |
| Car Pooling | Medium | 56.2% | 25.0% | ArraySortingHeap (Priority Queue)+2 |
| Find in Mountain Array | Hard | 41.1% | 25.0% | ArrayBinary SearchInteractive |
| Parsing A Boolean Expression | Hard | 69.8% | 25.0% | StringStackRecursion |
| Handshakes That Don't Cross | Hard | 59.9% | 25.0% | |
| Remove Covered Intervals | Medium | 56.1% | 25.0% | ArraySorting |
| Shortest Path with Alternating Colors | Medium | 47.7% | 25.0% | Breadth-First SearchGraph Theory |
| N-th Tribonacci Number | Easy | 63.3% | 25.0% | MathDynamic ProgrammingMemoization |
| Sum of Nodes with Even-Valued Grandparent | Medium | 85.9% | 25.0% | TreeDepth-First SearchBreadth-First Search+1 |
| User Activity for the Past 30 Days I | Easy | 50.5% | 25.0% | Database |
| Snapshot Array | Medium | 36.7% | 25.0% | ArrayHash TableBinary Search+1 |
| Number of Dice Rolls With Target Sum | Medium | 62.2% | 25.0% | Dynamic Programming |
| Closest Divisors | Medium | 62.0% | 25.0% | Math |
| Largest Multiple of Three | Hard | 33.1% | 25.0% | ArrayMathDynamic Programming+2 |
| Product Price at a Given Date | Medium | 57.7% | 25.0% | Database |
| Prime Arrangements | Easy | 60.7% | 25.0% | Math |
| Diet Plan Performance | Easy | 55.8% | 25.0% | |
| Maximum Subarray Sum with One Deletion | Medium | 46.7% | 25.0% | ArrayDynamic Programming |
| Minimum Garden Perimeter to Collect Enough Apples | Medium | 55.5% | 25.0% | MathBinary Search |
| Reformat Department Table | Easy | 76.3% | 25.0% | Database |
| Longest Happy String | Medium | 65.5% | 25.0% | StringGreedyHeap (Priority Queue) |
| Last Person to Fit in the Bus | Medium | 68.9% | 25.0% | Database |
| Remove Sub-Folders from the Filesystem | Medium | 78.6% | 25.0% | ArrayStringDepth-First Search+1 |
| Count Number of Nice Subarrays | Medium | 74.8% | 25.0% | ArrayHash TableMath+2 |
| Minimum Remove to Make Valid Parentheses | Medium | 71.3% | 25.0% | StringStack |
| Maximum Score Words Formed by Letters | Hard | 81.6% | 25.0% | ArrayHash TableString+5 |
| Shift 2D Grid | Easy | 67.9% | 25.0% | ArrayMatrixSimulation |
| Find the Difference of Two Arrays | Easy | 81.3% | 25.0% | ArrayHash Table |
| Find Winner on a Tic Tac Toe Game | Easy | 54.5% | 25.0% | ArrayHash TableMatrix+1 |
| Shortest Path in a Grid with Obstacles Elimination | Hard | 46.1% | 25.0% | ArrayBreadth-First SearchMatrix |
| Students and Examinations | Easy | 60.9% | 25.0% | Database |
| Fair Distribution of Cookies | Medium | 69.8% | 25.0% | ArrayDynamic ProgrammingBacktracking+2 |
| Find N Unique Integers Sum up to Zero | Easy | 78.5% | 25.0% | ArrayMath |
| All Elements in Two Binary Search Trees | Medium | 80.2% | 25.0% | TreeDepth-First SearchBinary Search Tree+2 |
| Get Watched Videos by Your Friends | Medium | 52.1% | 25.0% | ArrayHash TableBreadth-First Search+2 |
| Find the Team Size | Easy | 89.6% | 25.0% | |
| Number of Operations to Make Network Connected | Medium | 66.1% | 25.0% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Delete Leaves With a Given Value | Medium | 77.2% | 25.0% | TreeDepth-First SearchBinary Tree |
| Restaurant Growth | Medium | 58.2% | 25.0% | Database |
| Remove Palindromic Subsequences | Easy | 77.0% | 25.0% | Two PointersString |
| Number of Substrings Containing All Three Characters | Medium | 73.5% | 25.0% | Hash TableStringSliding Window |
| The K Weakest Rows in a Matrix | Easy | 74.3% | 25.0% | ArrayBinary SearchSorting+2 |
| Check If N and Its Double Exist | Easy | 41.6% | 25.0% | ArrayHash TableTwo Pointers+2 |
| Movie Rating | Medium | 42.7% | 25.0% | Database |
| Students With Invalid Departments | Easy | 89.8% | 25.0% | |
| How Many Numbers Are Smaller Than the Current Number | Easy | 87.5% | 25.0% | ArrayHash TableSorting+1 |
| Count Number of Teams | Medium | 70.2% | 25.0% | ArrayDynamic ProgrammingBinary Indexed Tree+1 |
| Number of Steps to Reduce a Number in Binary Representation to One | Medium | 61.3% | 25.0% | StringBit ManipulationSimulation |
| String Matching in an Array | Easy | 69.7% | 25.0% | ArrayStringString Matching |
| Queries on a Permutation With Key | Medium | 84.8% | 25.0% | ArrayBinary Indexed TreeSimulation |
| NPV Queries | Easy | 82.9% | 25.0% | |
| Pseudo-Palindromic Paths in a Binary Tree | Medium | 68.4% | 25.0% | Bit ManipulationTreeDepth-First Search+2 |
| Max Dot Product of Two Subsequences | Hard | 69.3% | 25.0% | ArrayDynamic Programming |
| Allocate Mailboxes | Hard | 56.4% | 25.0% | ArrayMathDynamic Programming+1 |
| Reorder Routes to Make All Paths Lead to the City Zero | Medium | 65.6% | 25.0% | Depth-First SearchBreadth-First SearchGraph Theory |
| Shuffle the Array | Easy | 89.0% | 25.0% | Array |
| Design Browser History | Medium | 78.2% | 25.0% | ArrayLinked ListStack+3 |
| Longest Subarray of 1's After Deleting One Element | Medium | 71.0% | 25.0% | ArrayDynamic ProgrammingSliding Window |
| Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Hard | 66.3% | 25.0% | Union-FindGraph TheorySorting+2 |
| Minimum Difference Between Largest and Smallest Value in Three Moves | Medium | 59.2% | 25.0% | ArrayGreedySorting |
| Check If Array Pairs Are Divisible by k | Medium | 46.2% | 25.0% | ArrayHash TableCounting |
| Number of Subsequences That Satisfy the Given Sum Condition | Medium | 49.3% | 25.0% | ArrayTwo PointersBinary Search+1 |
| Sales by Day of the Week | Hard | 76.3% | 25.0% | |
| Can Make Arithmetic Progression From Sequence | Easy | 69.2% | 25.0% | ArraySorting |
| Clone N-ary Tree | Medium | 83.1% | 25.0% | |
| Number of Good Pairs | Easy | 89.8% | 25.0% | ArrayHash TableMath+1 |
| Friendly Movies Streamed Last Month | Easy | 48.9% | 25.0% | |
| Maximum Number of Non-Overlapping Substrings | Hard | 41.4% | 25.0% | Hash TableStringGreedy+1 |
| Customer Order Frequency | Easy | 66.5% | 25.0% | |
| Minimum Numbers of Function Calls to Make Target Array | Medium | 62.8% | 25.0% | ArrayGreedyBit Manipulation |
| Minimum Cost to Cut a Stick | Hard | 62.8% | 25.0% | ArrayDynamic ProgrammingSorting |
| Find the Index of the Large Integer | Medium | 56.5% | 25.0% | |
| Magnetic Force Between Two Balls | Medium | 71.9% | 25.0% | ArrayBinary SearchSorting |
| Shortest Subarray to be Removed to Make Array Sorted | Medium | 51.3% | 25.0% | ArrayTwo PointersBinary Search+2 |
| Min Cost to Connect All Points | Medium | 70.3% | 25.0% | ArrayUnion-FindGraph Theory+1 |
| Warehouse Manager | Easy | 87.3% | 25.0% | |
| Maximum Number of Achievable Transfer Requests | Hard | 64.6% | 25.0% | ArrayBacktrackingBit Manipulation+1 |
| Number of Sets of K Non-Overlapping Line Segments | Medium | 45.6% | 25.0% | MathDynamic ProgrammingCombinatorics+1 |
| Build Binary Expression Tree From Infix Expression | Hard | 62.8% | 25.0% | |
| Maximum Nesting Depth of the Parentheses | Easy | 84.8% | 25.0% | StringStack |
| Sort Array by Increasing Frequency | Easy | 80.7% | 25.0% | ArrayHash TableSorting |
| Path With Minimum Effort | Medium | 62.8% | 25.0% | ArrayBinary SearchDepth-First Search+4 |
| Defuse the Bomb | Easy | 79.3% | 25.0% | ArraySliding Window |
| Find the Missing IDs | Medium | 72.9% | 25.0% | |
| All Valid Triplets That Can Represent a Country | Easy | 80.9% | 25.0% | |
| Design Front Middle Back Queue | Medium | 56.9% | 25.0% | ArrayLinked ListDesign+3 |
| Design an Expression Tree With Evaluate Function | Medium | 82.5% | 25.0% | |
| Add Two Polynomials Represented as Linked Lists | Medium | 61.0% | 25.0% | |
| Minimum Operations to Reduce X to Zero | Medium | 40.4% | 25.0% | ArrayHash TableBinary Search+2 |
| Max Number of K-Sum Pairs | Medium | 56.9% | 25.0% | ArrayHash TableTwo Pointers+1 |
| Concatenation of Consecutive Binary Numbers | Medium | 56.9% | 25.0% | MathBit ManipulationSimulation |
| Maximum Erasure Value | Medium | 64.1% | 25.0% | ArrayHash TableSliding Window |
| Lowest Common Ancestor of a Binary Tree IV | Medium | 79.5% | 25.0% | |
| Invalid Tweets | Easy | 85.2% | 25.0% | Database |
| Find the Highest Altitude | Easy | 83.9% | 25.0% | ArrayPrefix Sum |
| Decode XORed Permutation | Medium | 66.8% | 25.0% | ArrayBit Manipulation |
| Count Ways to Make Array With Product | Hard | 54.3% | 25.0% | ArrayMathDynamic Programming+2 |
| Number of Calls Between Two Persons | Medium | 80.8% | 25.0% | |
| Minimum Length of String After Deleting Similar Ends | Medium | 56.0% | 25.0% | Two PointersString |
| Form Array by Concatenating Subarrays of Another Array | Medium | 54.7% | 25.0% | ArrayTwo PointersGreedy+1 |
| The Number of Employees Which Report to Each Employee | Easy | 53.0% | 25.0% | Database |
| Find Distance in a Binary Tree | Medium | 74.3% | 25.0% | |
| Minimum Degree of a Connected Trio in a Graph | Hard | 44.2% | 25.0% | Graph TheoryEnumeration |
| Find Nearest Point That Has the Same X or Y Coordinate | Easy | 69.9% | 25.0% | Array |
| Count Pairs Of Nodes | Hard | 42.4% | 25.0% | ArrayHash TableTwo Pointers+4 |
| Find Total Time Spent by Each Employee | Easy | 86.4% | 25.0% | Database |
| Buildings With an Ocean View | Medium | 80.9% | 25.0% | |
| Sort Features by Popularity | Medium | 66.3% | 25.0% | |
| Product's Price for Each Store | Easy | 82.1% | 25.0% | |
| Grand Slam Titles | Medium | 82.9% | 25.0% | |
| Maximize the Beauty of the Garden | Hard | 64.6% | 25.0% | |
| Rearrange Products Table | Easy | 85.5% | 25.0% | Database |
| Maximum Element After Decreasing and Rearranging | Medium | 65.8% | 25.0% | ArrayGreedySorting |
| Closest Room | Hard | 41.1% | 25.0% | ArrayBinary SearchSorting+1 |
| Ad-Free Sessions | Easy | 58.8% | 25.0% | |
| Find Interview Candidates | Medium | 60.6% | 25.0% | |
| Next Palindrome Using Same Digits | Hard | 54.2% | 25.0% | |
| Distinct Numbers in Each Subarray | Medium | 77.3% | 25.0% | |
| Determine Whether Matrix Can Be Obtained By Rotation | Easy | 59.2% | 25.0% | ArrayMatrix |
| Minimum Space Wasted From Packaging | Hard | 33.4% | 25.0% | ArrayBinary SearchSorting+1 |
| Remove All Occurrences of a Substring | Medium | 78.4% | 25.0% | StringStackSimulation |
| Largest Odd Number in String | Easy | 66.9% | 25.0% | MathStringGreedy |
| Nearest Exit from Entrance in Maze | Medium | 48.3% | 25.0% | ArrayBreadth-First SearchMatrix |
| Build Array from Permutation | Easy | 91.1% | 25.0% | ArraySimulation |
| Longest Common Subpath | Hard | 29.3% | 25.0% | ArrayBinary SearchRolling Hash+2 |
| Jump Game VIII | Medium | 45.4% | 25.0% | |
| Unique Length-3 Palindromic Subsequences | Medium | 73.8% | 25.0% | Hash TableStringBit Manipulation+1 |
| Check for Contradictions in Equations | Hard | 43.8% | 25.0% | |
| Maximum of Minimum Values in All Subarrays | Medium | 48.0% | 25.0% | |
| Check if Move is Legal | Medium | 50.0% | 25.0% | ArrayMatrixEnumeration |
| Count Number of Special Subsequences | Hard | 52.7% | 25.0% | ArrayDynamic Programming |
| Number of Ways to Arrive at Destination | Medium | 37.3% | 25.0% | Dynamic ProgrammingGraph TheoryTopological Sort+1 |
| Minimum Number of Swaps to Make the String Balanced | Medium | 78.1% | 25.0% | Two PointersStringStack+1 |
| Minimize the Difference Between Target and Chosen Elements | Medium | 36.7% | 25.0% | ArrayDynamic ProgrammingMatrix |
| Minimum Difference Between Highest and Lowest of K Scores | Easy | 66.2% | 25.0% | ArraySliding WindowSorting |
| Count Number of Pairs With Absolute Difference K | Easy | 85.3% | 25.0% | ArrayHash TableCounting |
| Find if Path Exists in Graph | Easy | 54.7% | 25.0% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| GCD Sort of an Array | Hard | 48.5% | 25.0% | ArrayMathUnion-Find+2 |
| Sum of Beauty in the Array | Medium | 51.1% | 25.0% | Array |
| Minimum Number of Moves to Seat Everyone | Easy | 87.2% | 25.0% | ArrayGreedySorting+1 |
| Find Missing Observations | Medium | 57.4% | 25.0% | ArrayMathSimulation |
| Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 23.0% | 25.0% | ArrayTwo PointersBinary Search+5 |
| Kth Distinct String in an Array | Easy | 82.1% | 25.0% | ArrayHash TableString+1 |
| Find the Minimum and Maximum Number of Nodes Between Critical Points | Medium | 69.4% | 25.0% | Linked List |
| Minimized Maximum of Products Distributed to Any Store | Medium | 63.0% | 25.0% | ArrayBinary SearchGreedy |
| Decode the Slanted Ciphertext | Medium | 50.3% | 25.0% | StringSimulation |
| Find Good Days to Rob the Bank | Medium | 51.4% | 25.0% | ArrayDynamic ProgrammingPrefix Sum |
| Sequentially Ordinal Rank Tracker | Hard | 61.5% | 25.0% | DesignHeap (Priority Queue)Data Stream+1 |
| Step-By-Step Directions From a Binary Tree Node to Another | Medium | 56.4% | 25.0% | StringTreeDepth-First Search+1 |
| Find All Possible Recipes from Given Supplies | Medium | 56.8% | 25.0% | ArrayHash TableString+2 |
| Check if a Parentheses String Can Be Valid | Medium | 45.1% | 25.0% | StringStackGreedy |
| Adding Spaces to a String | Medium | 71.8% | 25.0% | ArrayTwo PointersString+1 |
| Number of Smooth Descent Periods of a Stock | Medium | 67.7% | 25.0% | ArrayMathTwo Pointers+2 |
| Minimum Operations to Make the Array K-Increasing | Hard | 40.2% | 25.0% | ArrayBinary Search |
| Maximum Twin Sum of a Linked List | Medium | 81.6% | 25.0% | Linked ListTwo PointersStack |
| Number of Laser Beams in a Bank | Medium | 87.0% | 25.0% | ArrayMathString+1 |
| Count the Hidden Sequences | Medium | 56.7% | 25.0% | ArrayPrefix Sum |
| Minimum Operations to Remove Adjacent Ones in Matrix | Hard | 42.8% | 25.0% | |
| Minimum Sum of Four Digit Number After Splitting Digits | Easy | 86.2% | 25.0% | MathGreedySorting |
| Partition Array According to Given Pivot | Medium | 89.8% | 25.0% | ArrayTwo PointersSimulation |
| Append K Integers With Minimal Sum | Medium | 26.8% | 25.0% | ArrayMathGreedy+1 |
| Replace Non-Coprime Numbers in Array | Hard | 57.7% | 25.0% | ArrayMathStack+1 |
| Maximize Number of Subsequences in a String | Medium | 35.9% | 25.0% | StringGreedyPrefix Sum |
| Longest Winning Streak | Hard | 54.1% | 25.0% | |
| Number of Ways to Select Buildings | Medium | 50.8% | 25.0% | StringDynamic ProgrammingPrefix Sum |
| Sum of Scores of Built Strings | Hard | 46.5% | 25.0% | StringBinary SearchRolling Hash+3 |
| K Divisible Elements Subarrays | Medium | 54.8% | 25.0% | ArrayHash TableTrie+3 |
| Total Appeal of A String | Hard | 56.3% | 25.0% | Hash TableStringDynamic Programming |
| Minimum Average Difference | Medium | 43.8% | 25.0% | ArrayPrefix Sum |
| Count Number of Texts | Medium | 49.9% | 25.0% | Hash TableMathString+1 |
| Maximum Consecutive Floors Without Special Floors | Medium | 52.5% | 25.0% | ArraySorting |
| Number of Ways to Split Array | Medium | 55.9% | 25.0% | ArrayPrefix Sum |
| Substring With Largest Variance | Hard | 46.0% | 25.0% | Hash TableStringDynamic Programming+1 |
| Minimum Rounds to Complete All Tasks | Medium | 63.2% | 25.0% | ArrayHash TableGreedy+1 |
| Maximum Bags With Full Capacity of Rocks | Medium | 68.0% | 25.0% | ArrayGreedySorting |
| Maximum Sum Score of Array | Medium | 62.6% | 25.0% | |
| Users With Two Purchases Within Seven Days | Medium | 46.6% | 25.0% | |
| Rearrange Characters to Make Target String | Easy | 61.0% | 25.0% | Hash TableStringCounting |
| Number of Times a Driver Was a Passenger | Medium | 71.6% | 25.0% | |
| Partition Array Such That Maximum Difference Is K | Medium | 81.9% | 25.0% | ArrayGreedySorting |
| Replace Elements in an Array | Medium | 59.6% | 25.0% | ArrayHash TableSimulation |
| Design a Text Editor | Hard | 49.9% | 25.0% | Linked ListStringStack+3 |
| Successful Pairs of Spells and Potions | Medium | 49.4% | 25.0% | ArrayTwo PointersBinary Search+1 |
| Minimum Score After Removals on a Tree | Hard | 76.2% | 25.0% | ArrayBit ManipulationTree+1 |
| Count Unreachable Pairs of Nodes in an Undirected Graph | Medium | 49.8% | 25.0% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Smallest Number in Infinite Set | Medium | 70.6% | 25.0% | Hash TableDesignHeap (Priority Queue)+1 |
| Move Pieces to Obtain a String | Medium | 56.7% | 25.0% | Two PointersString |
| Minimum Sum of Squared Difference | Medium | 26.7% | 25.0% | ArrayBinary SearchGreedy+2 |
| Design a Food Rating System | Medium | 52.9% | 25.0% | ArrayHash TableString+3 |
| Products With Three or More Orders in Two Consecutive Years | Medium | 40.5% | 25.0% | |
| Count Number of Bad Pairs | Medium | 54.2% | 25.0% | ArrayHash TableMath+1 |
| Maximum Number of Robots Within Budget | Hard | 38.0% | 25.0% | ArrayBinary SearchQueue+4 |
| Product Sales Analysis IV | Medium | 75.9% | 25.0% | |
| Product Sales Analysis V | Easy | 70.8% | 25.0% | |
| Construct Smallest Number From DI String | Medium | 85.6% | 25.0% | StringBacktrackingStack+1 |
| Find Minimum Time to Finish All Jobs II | Medium | 66.0% | 25.0% | |
| Find the K-Sum of an Array | Hard | 41.1% | 25.0% | ArraySortingHeap (Priority Queue) |
| Time Needed to Rearrange a Binary String | Medium | 52.6% | 25.0% | StringDynamic ProgrammingSimulation |
| Valid Palindrome IV | Medium | 75.7% | 25.0% | |
| Meeting Rooms III | Hard | 51.7% | 25.0% | ArrayHash TableSorting+2 |
| Strictly Palindromic Number | Medium | 90.2% | 25.0% | MathTwo PointersBrainteaser |
| Optimal Partition of String | Medium | 78.4% | 25.0% | Hash TableStringGreedy |
| Maximum Matching of Players With Trainers | Medium | 75.2% | 25.0% | ArrayTwo PointersGreedy+1 |
| Smallest Subarrays With Maximum Bitwise OR | Medium | 62.0% | 25.0% | ArrayBinary SearchBit Manipulation+1 |
| Minimum Money Required Before Transactions | Hard | 42.0% | 25.0% | ArrayGreedySorting |
| Employees With Deductions | Medium | 42.3% | 25.0% | |
| Sum of Number and Its Reverse | Medium | 49.3% | 25.0% | MathEnumeration |
| Design SQL | Medium | 64.7% | 25.0% | |
| Minimum Number of Operations to Sort a Binary Tree by Level | Medium | 74.2% | 25.0% | TreeBreadth-First SearchBinary Tree |
| Number of Distinct Averages | Easy | 58.9% | 25.0% | ArrayHash TableTwo Pointers+1 |
| Merge Operations to Turn Array Into a Palindrome | Medium | 68.9% | 25.0% | |
| Find the Pivot Integer | Easy | 83.8% | 25.0% | MathPrefix Sum |
| Append Characters to String to Make Subsequence | Medium | 73.0% | 25.0% | Two PointersStringGreedy |
| Remove Nodes From Linked List | Medium | 74.8% | 25.0% | Linked ListStackRecursion+1 |
| Longest Square Streak in an Array | Medium | 53.1% | 25.0% | ArrayHash TableBinary Search+2 |
| Design Memory Allocator | Medium | 49.7% | 25.0% | ArrayHash TableDesign+1 |
| Maximum Star Sum of a Graph | Medium | 41.9% | 25.0% | ArrayGreedyGraph Theory+2 |
| Difference Between Ones and Zeros in Row and Column | Medium | 84.4% | 25.0% | ArrayMatrixSimulation |
| Customers With Strictly Increasing Purchases | Hard | 49.0% | 25.0% | |
| Time Taken to Cross the Door | Hard | 50.1% | 25.0% | |
| Find Xor-Beauty of Array | Medium | 70.5% | 25.0% | ArrayMathBit Manipulation |
| Kth Largest Sum in a Binary Tree | Medium | 59.0% | 25.0% | TreeBreadth-First SearchSorting+1 |
| Split With Minimum Sum | Easy | 73.3% | 25.0% | MathGreedySorting |
| Count the Number of K-Big Indices | Hard | 53.6% | 25.0% | |
| Find the Substring With Maximum Cost | Medium | 57.8% | 25.0% | ArrayHash TableString+1 |
| Cousins in Binary Tree II | Medium | 75.8% | 25.0% | Hash TableTreeDepth-First Search+2 |
| Count the Number of Fair Pairs | Medium | 52.7% | 25.0% | ArrayTwo PointersBinary Search+1 |
| Find the Divisibility Array of a String | Medium | 35.7% | 25.0% | ArrayMathString |
| Row With Maximum Ones | Easy | 74.3% | 25.0% | ArrayMatrix |
| Count the Number of K-Free Subsets | Medium | 47.2% | 25.0% | |
| Count Zero Request Servers | Medium | 35.6% | 25.0% | ArrayHash TableSliding Window+1 |
| Relocate Marbles | Medium | 51.2% | 25.0% | ArrayHash TableSorting+1 |
| Double a Number Represented as a Linked List | Medium | 61.3% | 25.0% | Linked ListMathStack |
| Count Stepping Numbers in Range | Hard | 27.7% | 25.0% | StringDynamic Programming |
| Maximum Sum of Almost Unique Subarray | Medium | 40.7% | 25.0% | ArrayHash TableSliding Window |
| Maximize the Profit as the Salesman | Medium | 38.0% | 25.0% | ArrayHash TableBinary Search+2 |
| Number of Unique Categories | Medium | 83.6% | 25.0% | |
| Minimum Right Shifts to Sort the Array | Easy | 57.3% | 25.0% | Array |
| Maximal Range That Each Element Is Maximum in It | Medium | 75.5% | 25.0% | |
| Subarrays Distinct Element Sum of Squares II | Hard | 22.7% | 25.0% | ArrayDynamic ProgrammingBinary Indexed Tree+1 |
| Maximum Linear Stock Score | Medium | 61.2% | 25.0% | |
| Find the K-or of an Array | Easy | 72.7% | 25.0% | ArrayBit Manipulation |
| Maximum Balanced Subsequence Sum | Hard | 25.7% | 25.0% | ArrayBinary SearchDynamic Programming+2 |
| Distribute Candies Among Children I | Easy | 76.2% | 25.0% | MathCombinatoricsEnumeration |
| Make Three Strings Equal | Easy | 44.5% | 25.0% | String |
| Count Beautiful Substrings II | Hard | 26.7% | 25.0% | Hash TableMathString+2 |
| Count Beautiful Substrings I | Medium | 60.8% | 25.0% | Hash TableMathString+3 |
| Find Maximum Non-decreasing Array Length | Hard | 18.5% | 25.0% | ArrayBinary SearchDynamic Programming+4 |
| Distribute Candies Among Children III | Hard | 57.2% | 25.0% | |
| Find Number of Coins to Place in Tree Nodes | Hard | 37.2% | 25.0% | Dynamic ProgrammingTreeDepth-First Search+2 |
| Minimum Number of Coins to be Added | Medium | 57.9% | 25.0% | ArrayGreedySorting |
| Count Elements With Maximum Frequency | Easy | 79.8% | 25.0% | ArrayHash TableCounting |
| Minimum Number of Pushes to Type Word I | Easy | 66.9% | 25.0% | MathStringGreedy |
| Find the Maximum Number of Elements in Subset | Medium | 26.8% | 25.0% | ArrayHash TableEnumeration |
| Count Numbers With Unique Digits II | Easy | 87.1% | 25.0% | |
| Maximize Happiness of Selected Children | Medium | 58.7% | 25.0% | ArrayGreedySorting |
| Replace Question Marks in String to Minimize Its Value | Medium | 29.0% | 25.0% | Hash TableStringGreedy+3 |
| Find the Median of the Uniqueness Array | Hard | 29.9% | 25.0% | ArrayHash TableBinary Search+1 |
| Most Frequent IDs | Medium | 42.5% | 25.0% | ArrayHash TableHeap (Priority Queue)+1 |
| Score of a String | Easy | 91.4% | 25.0% | String |
| Find the Number of Subarrays Where Boundary Elements Are Maximum | Hard | 32.8% | 25.0% | ArrayBinary SearchStack+1 |
| Count the Number of Special Characters II | Medium | 43.2% | 25.0% | Hash TableString |
| Count the Number of Special Characters I | Easy | 66.7% | 25.0% | Hash TableString |
| Find Number of Ways to Reach the K-th Stair | Hard | 37.4% | 25.0% | MathDynamic ProgrammingBit Manipulation+2 |
| Generate Binary Strings Without Adjacent Zeros | Medium | 88.2% | 25.0% | StringBacktrackingBit Manipulation |
| Minimum Average of Smallest and Largest Elements | Easy | 85.3% | 25.0% | ArrayTwo PointersSorting |
| Count Triplets with Even XOR Set Bits I | Easy | 82.9% | 25.0% | |
| Count Triplets with Even XOR Set Bits II | Medium | 61.2% | 25.0% | |
| Double Modular Exponentiation | Medium | 47.9% | 25.0% | ArrayMathSimulation |
| Magic Squares In Grid | Medium | 55.1% | 25.0% | ArrayHash TableMath+1 |
| Percentage of Users Attended a Contest | Easy | 59.9% | 25.0% | Database |
| Delete Nodes From Linked List Present in Array | Medium | 69.5% | 25.0% | ArrayHash TableLinked List |
| Longest Subarray With Maximum Bitwise AND | Medium | 65.4% | 25.0% | ArrayBit ManipulationBrainteaser |
| K-th Smallest in Lexicographical Order | Hard | 46.2% | 25.0% | Trie |
| Maximum Matrix Sum | Medium | 67.6% | 25.0% | ArrayGreedyMatrix |
| Design an Array Statistics Tracker | Hard | 35.6% | 25.0% | |
| Minimum Array Sum | Medium | 30.9% | 25.0% | ArrayDynamic Programming |
| Two Best Non-Overlapping Events | Medium | 64.0% | 25.0% | ArrayBinary SearchDynamic Programming+2 |
| Max Chunks To Make Sorted | Medium | 64.1% | 25.0% | ArrayStackGreedy+2 |
| Minimum Number of Moves to Make Palindrome | Hard | 52.6% | 25.0% | Two PointersStringGreedy+1 |
| Count Vowel Strings in Ranges | Medium | 67.8% | 25.0% | ArrayStringPrefix Sum |
| Number of Zero-Filled Subarrays | Medium | 70.1% | 25.0% | ArrayMath |
| Minimum Number of Operations to Make Elements in Array Distinct | Easy | 71.3% | 25.0% | ArrayHash Table |
| Substring Matching Pattern | Easy | 28.3% | 25.0% | StringString Matching |
| Word Subsets | Medium | 55.9% | 25.0% | ArrayHash TableString |
| Count Servers that Communicate | Medium | 73.5% | 25.0% | ArrayDepth-First SearchBreadth-First Search+3 |
| Course Schedule IV | Medium | 59.7% | 25.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Shortest Matching Substring | Hard | 23.8% | 25.0% | Two PointersStringBinary Search+1 |
| Length of Longest V-Shaped Diagonal Segment | Hard | 56.3% | 25.0% | ArrayDynamic ProgrammingMemoization+1 |
| Final Prices With a Special Discount in a Shop | Easy | 84.0% | 25.0% | ArrayStackMonotonic Stack |
| Maximum Sum With at Most K Elements | Medium | 60.5% | 25.0% | ArrayGreedySorting+2 |
| Lexicographically Minimum String After Removing Stars | Medium | 51.0% | 25.0% | Hash TableStringStack+2 |
| Check If Digits Are Equal in String After Operations I | Easy | 82.5% | 25.0% | MathStringSimulation+2 |
| House Robber IV | Medium | 64.8% | 25.0% | ArrayBinary SearchDynamic Programming+1 |
| Maximum Candies Allocated to K Children | Medium | 49.9% | 25.0% | ArrayBinary Search |
| Minimum Operations to Make the Array Alternating | Medium | 35.3% | 25.0% | ArrayHash TableGreedy+1 |
| Greatest Sum Divisible by Three | Medium | 57.1% | 25.0% | ArrayDynamic ProgrammingGreedy+1 |
| Count Covered Buildings | Medium | 58.8% | 25.0% | ArrayHash TableSorting |
| Count Subarrays of Length Three With a Condition | Easy | 61.5% | 25.0% | Array |
| Count the Number of Substrings With Dominant Ones | Medium | 42.1% | 25.0% | StringEnumeration |
| Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values | Medium | 63.2% | 25.0% | ArrayHash TableGreedy+2 |
| Find the Maximum Length of Valid Subsequence I | Medium | 54.9% | 25.0% | ArrayDynamic Programming |
| Count Subarrays With Median K | Hard | 47.6% | 25.0% | ArrayHash TablePrefix Sum |
| Soup Servings | Medium | 59.7% | 25.0% | MathDynamic ProgrammingProbability and Statistics |
| Maximum Total from Optimal Activation Order | Medium | 33.0% | 25.0% | ArrayTwo PointersGreedy+2 |
| Minimum Time to Activate String | Medium | 49.2% | 25.0% | ArrayBinary Search |
| Minimum Stability Factor of Array | Hard | 20.2% | 25.0% | ArrayMathBinary Search+3 |
| Trionic Array I | Easy | 49.5% | 25.0% | Array |
| Threshold Majority Queries | Hard | 21.7% | 25.0% | ArrayHash TableBinary Search+3 |
| Trionic Array II | Hard | 47.3% | 25.0% | ArrayDynamic Programming |
| Maximum Median Sum of Subsequences of Size 3 | Medium | 65.0% | 25.0% | ArrayMathGreedy+2 |
| Minimum Removals to Balance Array | Medium | 47.9% | 25.0% | ArrayBinary SearchSliding Window+1 |
| New 21 Game | Medium | 52.0% | 25.0% | MathDynamic ProgrammingSliding Window+1 |
| Find the Minimum Area to Cover All Ones II | Hard | 63.5% | 25.0% | ArrayMatrixEnumeration |
| Count Bowl Subarrays | Medium | 47.9% | 25.0% | ArrayStackMonotonic Stack |
| Minimum Sensors to Cover Grid | Medium | 68.7% | 25.0% | Math |
| Sell Diminishing-Valued Colored Balls | Medium | 30.1% | 25.0% | ArrayMathBinary Search+3 |
| Avoid Flood in The City | Medium | 39.0% | 25.0% | ArrayHash TableBinary Search+2 |
| Maximum Calories Burnt from Jumps | Medium | 73.8% | 25.0% | |
| Maximize Points After Choosing K Tasks | Medium | 59.9% | 25.0% | ArrayGreedySorting+1 |
| Minimum Swaps to Avoid Forbidden Values | Hard | 30.2% | 25.0% | ArrayHash TableGreedy+1 |
| Total Sum of Interaction Cost in Tree Groups | Hard | 53.5% | 25.0% | ArrayTreeDepth-First Search |
| Maximum Score After Binary Swaps | Medium | 35.0% | 25.0% | ArrayStringGreedy+1 |
| Reverse String Prefix | Easy | 89.4% | 25.0% | Two PointersString |
| Maximum Bitwise AND After Increment Operations | Hard | 30.8% | 25.0% | ArrayGreedyBit Manipulation+1 |
| Maximum Capacity Within Budget | Medium | 19.9% | 25.0% | ArrayTwo PointersBinary Search+1 |
| Divide an Array Into Subarrays With Minimum Cost I | Easy | 80.5% | 25.0% | ArraySortingEnumeration |
| Remove Duplicates from Sorted List II | Medium | 51.3% | 12.5% | Linked ListTwo Pointers |
| Binary Tree Level Order Traversal II | Medium | 67.6% | 12.5% | TreeBreadth-First SearchBinary Tree |
| Convert Sorted List to Binary Search Tree | Medium | 65.9% | 12.5% | Linked ListDivide and ConquerTree+2 |
| Minimum Depth of Binary Tree | Easy | 52.3% | 12.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Binary Tree Preorder Traversal | Easy | 75.1% | 12.5% | StackTreeDepth-First Search+1 |
| Find Minimum in Rotated Sorted Array II | Hard | 44.6% | 12.5% | ArrayBinary Search |
| Longest Substring with At Most Two Distinct Characters | Medium | 57.0% | 12.5% | |
| Maximum Gap | Medium | 51.4% | 12.5% | ArraySortingBucket Sort+1 |
| Fraction to Recurring Decimal | Medium | 30.5% | 12.5% | Hash TableMathString |
| Factorial Trailing Zeroes | Medium | 46.1% | 12.5% | Math |
| Valid Phone Numbers | Easy | 28.9% | 12.5% | Shell |
| Bitwise AND of Numbers Range | Medium | 48.6% | 12.5% | Bit Manipulation |
| Contains Duplicate III | Hard | 24.4% | 12.5% | ArraySliding WindowSorting+2 |
| Count Complete Tree Nodes | Easy | 72.0% | 12.5% | Binary SearchBit ManipulationTree+1 |
| Shortest Word Distance | Easy | 66.2% | 12.5% | |
| Binary Tree Paths | Easy | 68.2% | 12.5% | StringBacktrackingTree+2 |
| Graph Valid Tree | Medium | 49.8% | 12.5% | |
| Closest Binary Search Tree Value II | Hard | 61.1% | 12.5% | |
| Best Meeting Point | Hard | 61.4% | 12.5% | |
| Remove Invalid Parentheses | Hard | 49.8% | 12.5% | StringBacktrackingBreadth-First Search |
| Best Time to Buy and Sell Stock with Cooldown | Medium | 61.7% | 12.5% | ArrayDynamic Programming |
| Maximum Product of Word Lengths | Medium | 61.0% | 12.5% | ArrayStringBit Manipulation |
| Create Maximum Number | Hard | 34.6% | 12.5% | ArrayTwo PointersStack+2 |
| Wiggle Sort II | Medium | 36.9% | 12.5% | ArrayDivide and ConquerGreedy+2 |
| Maximum Size Subarray Sum Equals k | Medium | 50.8% | 12.5% | |
| Count of Range Sum | Hard | 38.3% | 12.5% | ArrayBinary SearchDivide and Conquer+4 |
| Patching Array | Hard | 54.1% | 12.5% | ArrayGreedy |
| Palindrome Pairs | Hard | 36.9% | 12.5% | ArrayHash TableString+1 |
| Integer Break | Medium | 61.8% | 12.5% | MathDynamic Programming |
| Intersection of Two Arrays II | Easy | 59.7% | 12.5% | ArrayHash TableTwo Pointers+2 |
| Nested List Weight Sum II | Medium | 66.7% | 12.5% | |
| Find Leaves of Binary Tree | Medium | 81.3% | 12.5% | |
| Valid Perfect Square | Easy | 44.7% | 12.5% | MathBinary Search |
| Plus One Linked List | Medium | 61.2% | 12.5% | |
| Super Pow | Medium | 36.3% | 12.5% | MathDivide and Conquer |
| Guess Number Higher or Lower | Easy | 57.1% | 12.5% | Binary SearchInteractive |
| Combination Sum IV | Medium | 55.0% | 12.5% | ArrayDynamic Programming |
| Shuffle an Array | Medium | 59.5% | 12.5% | ArrayMathDesign+1 |
| Mini Parser | Medium | 42.0% | 12.5% | StringStackDepth-First Search |
| Longest Absolute File Path | Medium | 49.2% | 12.5% | StringStackDepth-First Search |
| Elimination Game | Medium | 45.9% | 12.5% | MathRecursion |
| Random Pick Index | Medium | 65.0% | 12.5% | Hash TableMathReservoir Sampling+1 |
| Convert a Number to Hexadecimal | Easy | 53.2% | 12.5% | MathStringBit Manipulation |
| Queue Reconstruction by Height | Medium | 74.6% | 12.5% | ArrayBinary Indexed TreeSegment Tree+1 |
| Arithmetic Slices | Medium | 64.8% | 12.5% | ArrayDynamic ProgrammingSliding Window |
| Strong Password Checker | Hard | 15.4% | 12.5% | StringGreedyHeap (Priority Queue) |
| Maximum XOR of Two Numbers in an Array | Medium | 53.4% | 12.5% | ArrayHash TableBit Manipulation+1 |
| Find Right Interval | Medium | 55.4% | 12.5% | ArrayBinary SearchSorting |
| Arithmetic Slices II - Subsequence | Hard | 54.9% | 12.5% | ArrayDynamic Programming |
| Minimum Moves to Equal Array Elements | Medium | 58.5% | 12.5% | ArrayMath |
| 4Sum II | Medium | 57.8% | 12.5% | ArrayHash Table |
| Circular Array Loop | Medium | 37.0% | 12.5% | ArrayHash TableTwo Pointers |
| Hamming Distance | Easy | 76.6% | 12.5% | Bit Manipulation |
| Minimum Moves to Equal Array Elements II | Medium | 61.5% | 12.5% | ArrayMathSorting |
| Can I Win | Medium | 31.0% | 12.5% | MathDynamic ProgrammingBit Manipulation+3 |
| Validate IP Address | Medium | 28.2% | 12.5% | String |
| Magical String | Medium | 54.5% | 12.5% | Two PointersString |
| Keyboard Row | Easy | 73.5% | 12.5% | ArrayHash TableString |
| Find Mode in Binary Search Tree | Easy | 58.5% | 12.5% | TreeDepth-First SearchBinary Search Tree+1 |
| Relative Ranks | Easy | 74.4% | 12.5% | ArraySortingHeap (Priority Queue) |
| Perfect Number | Easy | 47.9% | 12.5% | Math |
| Find Bottom Left Tree Value | Medium | 72.2% | 12.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Freedom Trail | Hard | 59.2% | 12.5% | StringDynamic ProgrammingDepth-First Search+1 |
| Find Largest Value in Each Tree Row | Medium | 66.3% | 12.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Beautiful Arrangement | Medium | 64.7% | 12.5% | ArrayDynamic ProgrammingBacktracking+2 |
| Reverse String II | Easy | 53.3% | 12.5% | Two PointersString |
| Brick Wall | Medium | 56.0% | 12.5% | ArrayHash Table |
| Kill Process | Medium | 70.3% | 12.5% | |
| Delete Operation for Two Strings | Medium | 65.2% | 12.5% | StringDynamic Programming |
| Investments in 2016 | Medium | 50.8% | 12.5% | Database |
| Erect the Fence | Hard | 52.7% | 12.5% | ArrayMathGeometry |
| Human Traffic of Stadium | Hard | 50.8% | 12.5% | Database |
| Friend Requests II: Who Has the Most Friends | Medium | 62.2% | 12.5% | Database |
| Sales Person | Easy | 65.8% | 12.5% | Database |
| Not Boring Movies | Easy | 75.1% | 12.5% | Database |
| Swap Sex of Employees | Easy | 84.5% | 12.5% | Database |
| Shopping Offers | Medium | 52.2% | 12.5% | ArrayDynamic ProgrammingBacktracking+3 |
| Replace Words | Medium | 68.6% | 12.5% | ArrayHash TableString+1 |
| Dota2 Senate | Medium | 49.6% | 12.5% | StringGreedyQueue |
| Find Duplicate Subtrees | Medium | 60.6% | 12.5% | Hash TableTreeDepth-First Search+1 |
| Print Binary Tree | Medium | 66.4% | 12.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Split Array into Consecutive Subsequences | Medium | 52.0% | 12.5% | ArrayHash TableGreedy+1 |
| Strange Printer | Hard | 60.9% | 12.5% | StringDynamic Programming |
| Trim a Binary Search Tree | Medium | 66.6% | 12.5% | TreeDepth-First SearchBinary Search Tree+1 |
| Number of Longest Increasing Subsequence | Medium | 51.3% | 12.5% | ArrayDynamic ProgrammingBinary Indexed Tree+1 |
| Repeated String Match | Medium | 38.3% | 12.5% | StringString Matching |
| Stickers to Spell Word | Hard | 50.6% | 12.5% | ArrayHash TableString+5 |
| Minimum ASCII Delete Sum for Two Strings | Medium | 70.9% | 12.5% | StringDynamic Programming |
| Best Time to Buy and Sell Stock with Transaction Fee | Medium | 71.7% | 12.5% | ArrayDynamic ProgrammingGreedy |
| Range Module | Hard | 44.7% | 12.5% | DesignSegment TreeOrdered Set |
| Maximum Length of Repeated Subarray | Medium | 51.2% | 12.5% | ArrayBinary SearchDynamic Programming+3 |
| Longest Word in Dictionary | Medium | 54.5% | 12.5% | ArrayHash TableString+2 |
| Number of Atoms | Hard | 65.1% | 12.5% | Hash TableStringStack+1 |
| Count Different Palindromic Subsequences | Hard | 47.5% | 12.5% | StringDynamic Programming |
| My Calendar II | Medium | 62.9% | 12.5% | ArrayBinary SearchDesign+3 |
| My Calendar III | Hard | 71.4% | 12.5% | Binary SearchDesignSegment Tree+2 |
| Find Smallest Letter Greater Than Target | Easy | 58.9% | 12.5% | ArrayBinary Search |
| Reach a Number | Medium | 44.6% | 12.5% | MathBinary Search |
| Convert Binary Search Tree to Sorted Doubly Linked List | Medium | 65.6% | 12.5% | |
| Employee Free Time | Hard | 72.8% | 12.5% | |
| N-ary Tree Level Order Traversal | Medium | 71.5% | 12.5% | TreeBreadth-First Search |
| Construct Quad Tree | Medium | 78.1% | 12.5% | ArrayDivide and ConquerTree+1 |
| Reaching Points | Hard | 34.2% | 12.5% | Math |
| Rabbits in Forest | Medium | 58.0% | 12.5% | ArrayHash TableMath+1 |
| Letter Case Permutation | Medium | 75.7% | 12.5% | StringBacktrackingBit Manipulation |
| K-th Smallest Prime Fraction | Medium | 69.0% | 12.5% | ArrayTwo PointersBinary Search+2 |
| Rotated Digits | Medium | 56.8% | 12.5% | MathDynamic Programming |
| Number of Matching Subsequences | Medium | 50.6% | 12.5% | ArrayHash TableString+4 |
| Design HashSet | Easy | 67.7% | 12.5% | ArrayHash TableLinked List+2 |
| Largest Triangle Area | Easy | 71.5% | 12.5% | ArrayMathGeometry |
| Binary Tree Pruning | Medium | 72.4% | 12.5% | TreeDepth-First SearchBinary Tree |
| Linked List Components | Medium | 57.7% | 12.5% | ArrayHash TableLinked List |
| Race Car | Hard | 44.6% | 12.5% | Dynamic Programming |
| Insert into a Sorted Circular Linked List | Medium | 38.5% | 12.5% | |
| Count Unique Characters of All Substrings of a Given String | Hard | 53.5% | 12.5% | Hash TableStringDynamic Programming |
| Flipping an Image | Easy | 83.6% | 12.5% | ArrayTwo PointersBit Manipulation+2 |
| Sum of Distances in Tree | Hard | 65.5% | 12.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Robot Room Cleaner | Hard | 77.9% | 12.5% | |
| Rectangle Overlap | Easy | 46.4% | 12.5% | MathGeometry |
| Similar String Groups | Hard | 56.1% | 12.5% | ArrayHash TableString+3 |
| Longest Mountain in Array | Medium | 41.8% | 12.5% | ArrayTwo PointersDynamic Programming+1 |
| Hand of Straights | Medium | 57.8% | 12.5% | ArrayHash TableGreedy+1 |
| Shortest Path Visiting All Nodes | Hard | 65.7% | 12.5% | Dynamic ProgrammingBit ManipulationBreadth-First Search+2 |
| Maximize Distance to Closest Person | Medium | 49.6% | 12.5% | Array |
| Score After Flipping Matrix | Medium | 80.3% | 12.5% | ArrayGreedyBit Manipulation+1 |
| Advantage Shuffle | Medium | 54.2% | 12.5% | ArrayTwo PointersGreedy+1 |
| Leaf-Similar Trees | Easy | 70.2% | 12.5% | TreeDepth-First SearchBinary Tree |
| Walking Robot Simulation | Medium | 58.4% | 12.5% | ArrayHash TableSimulation |
| Profitable Schemes | Hard | 48.2% | 12.5% | ArrayDynamic Programming |
| Decoded String at Index | Medium | 37.2% | 12.5% | StringStack |
| Spiral Matrix III | Medium | 84.5% | 12.5% | ArrayMatrixSimulation |
| Super Egg Drop | Hard | 29.8% | 12.5% | MathBinary SearchDynamic Programming |
| Fair Candy Swap | Easy | 64.5% | 12.5% | ArrayHash TableBinary Search+1 |
| Construct Binary Tree from Preorder and Postorder Traversal | Medium | 78.1% | 12.5% | ArrayHash TableDivide and Conquer+2 |
| All Possible Full Binary Trees | Medium | 82.8% | 12.5% | Dynamic ProgrammingTreeRecursion+2 |
| Monotonic Array | Easy | 62.2% | 12.5% | Array |
| Increasing Order Search Tree | Easy | 78.9% | 12.5% | StackTreeDepth-First Search+2 |
| Sort Array By Parity | Easy | 76.5% | 12.5% | ArrayTwo PointersSorting |
| Smallest Range II | Medium | 37.7% | 12.5% | ArrayMathGreedy+1 |
| Cat and Mouse | Hard | 34.7% | 12.5% | MathDynamic ProgrammingGraph Theory+3 |
| Beautiful Array | Medium | 68.6% | 12.5% | ArrayMathDivide and Conquer |
| Knight Dialer | Medium | 61.7% | 12.5% | Dynamic Programming |
| Range Sum of BST | Easy | 87.6% | 12.5% | TreeDepth-First SearchBinary Search Tree+1 |
| Validate Stack Sequences | Medium | 70.2% | 12.5% | ArrayStackSimulation |
| Bag of Tokens | Medium | 59.5% | 12.5% | ArrayTwo PointersGreedy+1 |
| Flip Equivalent Binary Trees | Medium | 69.6% | 12.5% | TreeDepth-First SearchBinary Tree |
| Verifying an Alien Dictionary | Easy | 55.9% | 12.5% | ArrayHash TableString |
| Check Completeness of a Binary Tree | Medium | 58.9% | 12.5% | TreeBreadth-First SearchBinary Tree |
| Odd Even Jump | Hard | 41.1% | 12.5% | ArrayDynamic ProgrammingStack+3 |
| Largest Perimeter Triangle | Easy | 62.0% | 12.5% | ArrayMathGreedy+1 |
| Cousins in Binary Tree | Easy | 59.1% | 12.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Minimum Number of K Consecutive Bit Flips | Hard | 62.2% | 12.5% | ArrayBit ManipulationQueue+2 |
| Number of Valid Subarrays | Hard | 79.9% | 12.5% | |
| Next Greater Node In Linked List | Medium | 63.8% | 12.5% | ArrayLinked ListStack+1 |
| Number of Enclaves | Medium | 71.5% | 12.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Divisor Game | Easy | 71.5% | 12.5% | MathDynamic ProgrammingBrainteaser+1 |
| Longest Arithmetic Subsequence | Medium | 49.9% | 12.5% | ArrayHash TableBinary Search+1 |
| Two City Scheduling | Medium | 68.3% | 12.5% | ArrayGreedySorting |
| Stream of Characters | Hard | 51.9% | 12.5% | ArrayStringDesign+2 |
| Minimum Score Triangulation of Polygon | Medium | 67.4% | 12.5% | ArrayDynamic Programming |
| As Far from Land as Possible | Medium | 52.2% | 12.5% | ArrayDynamic ProgrammingBreadth-First Search+1 |
| Partition Array for Maximum Sum | Medium | 77.3% | 12.5% | ArrayDynamic Programming |
| Longest String Chain | Medium | 62.8% | 12.5% | ArrayHash TableTwo Pointers+3 |
| Last Substring in Lexicographical Order | Hard | 35.0% | 12.5% | Two PointersString |
| Height Checker | Easy | 81.5% | 12.5% | ArraySortingCounting Sort |
| Minimum Knight Moves | Medium | 41.7% | 12.5% | |
| Letter Tile Possibilities | Medium | 83.5% | 12.5% | Hash TableStringBacktracking+1 |
| Project Employees I | Easy | 66.5% | 12.5% | Database |
| Meeting Scheduler | Medium | 55.2% | 12.5% | |
| Duplicate Zeros | Easy | 53.4% | 12.5% | ArrayTwo Pointers |
| Design A Leaderboard | Medium | 68.1% | 12.5% | |
| Game Play Analysis I | Easy | 76.2% | 12.5% | Database |
| Building H2O | Medium | 58.3% | 12.5% | Concurrency |
| Distribute Candies to People | Easy | 67.4% | 12.5% | MathSimulation |
| Filling Bookcase Shelves | Medium | 68.6% | 12.5% | ArrayDynamic Programming |
| Defanging an IP Address | Easy | 90.0% | 12.5% | String |
| Corporate Flight Bookings | Medium | 66.4% | 12.5% | ArrayPrefix Sum |
| Delete Nodes And Return Forest | Medium | 72.5% | 12.5% | ArrayHash TableTree+2 |
| Relative Sort Array | Easy | 75.1% | 12.5% | ArrayHash TableSorting+1 |
| Lowest Common Ancestor of Deepest Leaves | Medium | 79.4% | 12.5% | Hash TableTreeDepth-First Search+2 |
| Element Appearing More Than 25% In Sorted Array | Easy | 61.1% | 12.5% | Array |
| Minimum Falling Path Sum II | Hard | 63.2% | 12.5% | ArrayDynamic ProgrammingMatrix |
| Stone Game II | Medium | 72.9% | 12.5% | ArrayMathDynamic Programming+2 |
| Decompress Run-Length Encoded List | Easy | 86.2% | 12.5% | Array |
| Sort the Matrix Diagonally | Medium | 83.2% | 12.5% | ArraySortingMatrix |
| Deepest Leaves Sum | Medium | 86.5% | 12.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Day of the Year | Easy | 49.5% | 12.5% | MathString |
| Remove Zero Sum Consecutive Nodes from Linked List | Medium | 53.1% | 12.5% | Hash TableLinked List |
| Invalid Transactions | Medium | 32.1% | 12.5% | ArrayHash TableString+1 |
| Number of Days Between Two Dates | Easy | 52.3% | 12.5% | MathString |
| Three Consecutive Odds | Easy | 69.3% | 12.5% | Array |
| Kth Ancestor of a Tree Node | Hard | 37.1% | 12.5% | Binary SearchDynamic ProgrammingBit Manipulation+4 |
| Maximum Number of Balloons | Easy | 60.0% | 12.5% | Hash TableStringCounting |
| Reverse Substrings Between Each Pair of Parentheses | Medium | 71.9% | 12.5% | StringStack |
| Minimum Moves to Reach Target Score | Medium | 52.0% | 12.5% | MathGreedy |
| Number of Visible People in a Queue | Hard | 72.3% | 12.5% | ArrayStackMonotonic Stack |
| Path with Maximum Probability | Medium | 65.5% | 12.5% | ArrayGraph TheoryHeap (Priority Queue)+1 |
| Path with Maximum Gold | Medium | 68.3% | 12.5% | ArrayBacktrackingMatrix |
| Queries Quality and Percentage | Easy | 52.2% | 12.5% | Database |
| Check If It Is a Straight Line | Easy | 40.0% | 12.5% | ArrayMathGeometry |
| Replace the Substring for Balanced String | Medium | 40.6% | 12.5% | StringSliding Window |
| Find Resultant Array After Removing Anagrams | Easy | 69.9% | 12.5% | ArrayHash TableString+1 |
| Report Contiguous Dates | Hard | 57.1% | 12.5% | |
| Number of Closed Islands | Medium | 67.0% | 12.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Group the People Given the Group Size They Belong To | Medium | 87.5% | 12.5% | ArrayHash TableGreedy |
| Traffic Light Controlled Intersection | Easy | 72.8% | 12.5% | |
| Convert Binary Number in a Linked List to Integer | Easy | 82.3% | 12.5% | Linked ListMath |
| Maximum Side Length of a Square with Sum Less than or Equal to Threshold | Medium | 65.5% | 12.5% | ArrayBinary SearchMatrix+1 |
| Find Numbers with Even Number of Digits | Easy | 79.6% | 12.5% | ArrayMath |
| XOR Queries of a Subarray | Medium | 78.2% | 12.5% | ArrayBit ManipulationPrefix Sum |
| Minimum Insertion Steps to Make a String Palindrome | Hard | 73.6% | 12.5% | StringDynamic Programming |
| Number of Steps to Reduce a Number to Zero | Easy | 85.7% | 12.5% | MathBit Manipulation |
| Angle Between Hands of a Clock | Medium | 64.4% | 12.5% | Math |
| Jump Game IV | Hard | 46.2% | 12.5% | ArrayHash TableBreadth-First Search |
| Maximum 69 Number | Easy | 84.5% | 12.5% | MathGreedy |
| Minimum Number of Taps to Open to Water a Garden | Hard | 51.0% | 12.5% | ArrayDynamic ProgrammingGreedy |
| Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | 72.1% | 12.5% | Dynamic ProgrammingGraph TheoryShortest Path |
| Minimum Difficulty of a Job Schedule | Hard | 59.7% | 12.5% | ArrayDynamic Programming |
| Sort Integers by The Number of 1 Bits | Easy | 79.0% | 12.5% | ArrayBit ManipulationSorting+1 |
| Maximum Product of Splitted Binary Tree | Medium | 55.5% | 12.5% | TreeDepth-First SearchBinary Tree |
| Minimum Number of Steps to Make Two Strings Anagram | Medium | 82.5% | 12.5% | Hash TableStringCounting |
| Longest ZigZag Path in a Binary Tree | Medium | 67.0% | 12.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Product of the Last K Numbers | Medium | 62.9% | 12.5% | ArrayMathDesign+2 |
| Linked List in Binary Tree | Medium | 51.9% | 12.5% | Linked ListTreeDepth-First Search+1 |
| Time Needed to Inform All Employees | Medium | 60.4% | 12.5% | TreeDepth-First SearchBreadth-First Search |
| Design a Stack With Increment Operation | Medium | 79.9% | 12.5% | ArrayStackDesign |
| Find a Corresponding Node of a Binary Tree in a Clone of That Tree | Easy | 85.8% | 12.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Reducing Dishes | Hard | 76.6% | 12.5% | ArrayDynamic ProgrammingGreedy+1 |
| Create Target Array in the Given Order | Easy | 86.5% | 12.5% | ArraySimulation |
| Longest Happy Prefix | Hard | 51.6% | 12.5% | StringRolling HashString Matching+1 |
| Design Underground System | Medium | 74.4% | 12.5% | Hash TableStringDesign |
| Maximum Score After Splitting a String | Easy | 65.1% | 12.5% | StringPrefix Sum |
| Diagonal Traverse II | Medium | 58.3% | 12.5% | ArraySortingHeap (Priority Queue) |
| Count Good Nodes in Binary Tree | Medium | 73.8% | 12.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Destination City | Easy | 79.5% | 12.5% | ArrayHash TableString |
| Cherry Pickup II | Hard | 72.3% | 12.5% | ArrayDynamic ProgrammingMatrix |
| Maximum Product of Two Elements in an Array | Easy | 83.5% | 12.5% | ArraySortingHeap (Priority Queue) |
| Active Users | Medium | 36.6% | 12.5% | |
| Least Number of Unique Integers after K Removals | Medium | 63.7% | 12.5% | ArrayHash TableGreedy+2 |
| Count Odd Numbers in an Interval Range | Easy | 54.4% | 12.5% | Math |
| Minimum Number of Increments on Subarrays to Form a Target Array | Hard | 78.1% | 12.5% | ArrayDynamic ProgrammingStack+2 |
| String Compression II | Hard | 52.2% | 12.5% | StringDynamic Programming |
| Water Bottles | Easy | 72.6% | 12.5% | MathSimulation |
| Minimum Suffix Flips | Medium | 73.9% | 12.5% | StringGreedy |
| Count Good Triplets | Easy | 85.5% | 12.5% | ArrayEnumeration |
| Make The String Great | Easy | 68.4% | 12.5% | StringStack |
| Find Kth Bit in Nth Binary String | Medium | 70.2% | 12.5% | StringRecursionSimulation |
| Matrix Diagonal Sum | Easy | 84.1% | 12.5% | ArrayMatrix |
| Maximum Number of Coins You Can Get | Medium | 84.8% | 12.5% | ArrayMathGreedy+2 |
| Maximum Length of Subarray With Positive Product | Medium | 44.6% | 12.5% | ArrayDynamic ProgrammingGreedy |
| Sum of All Odd Length Subarrays | Easy | 83.9% | 12.5% | ArrayMathPrefix Sum |
| Dot Product of Two Sparse Vectors | Medium | 89.9% | 12.5% | |
| Crawler Log Folder | Easy | 71.6% | 12.5% | ArrayStringStack |
| Special Array With X Elements Greater Than or Equal X | Easy | 66.8% | 12.5% | ArrayBinary SearchSorting |
| Widest Vertical Area Between Two Points Containing No Points | Easy | 87.1% | 12.5% | ArraySorting |
| Minimum Jumps to Reach Home | Medium | 30.6% | 12.5% | ArrayHash TableBreadth-First Search |
| Maximum Repeating Substring | Easy | 41.0% | 12.5% | StringDynamic ProgrammingString Matching |
| Merge In Between Linked Lists | Medium | 82.8% | 12.5% | Linked List |
| Minimum Number of Removals to Make Mountain Array | Hard | 54.8% | 12.5% | ArrayBinary SearchDynamic Programming+1 |
| Get Maximum in Generated Array | Easy | 51.4% | 12.5% | ArraySimulation |
| Minimum Deletions to Make Character Frequencies Unique | Medium | 61.4% | 12.5% | Hash TableStringGreedy+1 |
| Determine if Two Strings Are Close | Medium | 54.2% | 12.5% | Hash TableStringSorting+1 |
| Check If Two String Arrays are Equivalent | Easy | 86.0% | 12.5% | ArrayString |
| Sum of Absolute Differences in a Sorted Array | Medium | 68.2% | 12.5% | ArrayMathPrefix Sum |
| Richest Customer Wealth | Easy | 88.7% | 12.5% | ArrayMatrix |
| Average Waiting Time | Medium | 73.1% | 12.5% | ArraySimulation |
| Count of Matches in Tournament | Easy | 86.3% | 12.5% | MathSimulation |
| Partitioning Into Minimum Number Of Deci-Binary Numbers | Medium | 88.8% | 12.5% | StringGreedy |
| Calculate Money in Leetcode Bank | Easy | 82.3% | 12.5% | Math |
| Maximum Score From Removing Substrings | Medium | 66.6% | 12.5% | StringStackGreedy |
| Construct the Lexicographically Largest Valid Sequence | Medium | 72.8% | 12.5% | ArrayBacktracking |
| Determine if String Halves Are Alike | Easy | 78.8% | 12.5% | StringCounting |
| Maximum Number of Events That Can Be Attended II | Hard | 63.6% | 12.5% | ArrayBinary SearchDynamic Programming+1 |
| Minimum Limit of Balls in a Bag | Medium | 66.6% | 12.5% | ArrayBinary Search |
| Minimum Number of Operations to Move All Balls to Each Box | Medium | 90.1% | 12.5% | ArrayStringPrefix Sum |
| Count Items Matching a Rule | Easy | 85.3% | 12.5% | ArrayString |
| Check if One String Swap Can Make Strings Equal | Easy | 49.5% | 12.5% | Hash TableStringCounting |
| Find Center of Star Graph | Easy | 86.6% | 12.5% | Graph Theory |
| Find the Winner of the Circular Game | Medium | 82.2% | 12.5% | ArrayMathRecursion+2 |
| Check if the Sentence Is Pangram | Easy | 84.1% | 12.5% | Hash TableString |
| Maximum Ice Cream Bars | Medium | 74.2% | 12.5% | ArrayGreedySorting+1 |
| Single-Threaded CPU | Medium | 47.3% | 12.5% | ArraySortingHeap (Priority Queue) |
| Sorting the Sentence | Easy | 84.1% | 12.5% | StringSorting |
| Maximum Population Year | Easy | 63.6% | 12.5% | ArrayCountingPrefix Sum |
| Substrings of Size Three with Distinct Characters | Easy | 76.5% | 12.5% | Hash TableStringSliding Window+1 |
| Minimum Speed to Arrive on Time | Medium | 47.7% | 12.5% | ArrayBinary Search |
| Process Tasks Using Servers | Medium | 41.9% | 12.5% | ArrayHeap (Priority Queue) |
| Remove One Element to Make the Array Strictly Increasing | Easy | 29.5% | 12.5% | Array |
| Count Sub Islands | Medium | 73.0% | 12.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Number of Wonderful Substrings | Medium | 66.6% | 12.5% | Hash TableStringBit Manipulation+1 |
| Find a Peak Element II | Medium | 54.4% | 12.5% | ArrayBinary SearchMatrix |
| Minimum Non-Zero Product of the Array Elements | Medium | 37.4% | 12.5% | MathGreedyRecursion |
| Minimum Number of Work Sessions to Finish the Tasks | Medium | 34.5% | 12.5% | ArrayDynamic ProgrammingBacktracking+2 |
| Employees Whose Manager Left the Company | Easy | 48.6% | 12.5% | Database |
| Reverse Prefix of Word | Easy | 86.5% | 12.5% | Two PointersStringStack |
| Convert 1D Array Into 2D Array | Easy | 72.1% | 12.5% | ArrayMatrixSimulation |
| Final Value of Variable After Performing Operations | Easy | 90.6% | 12.5% | ArrayStringSimulation |
| Detect Squares | Medium | 52.3% | 12.5% | ArrayHash TableDesign+2 |
| Time Needed to Buy Tickets | Easy | 72.1% | 12.5% | ArrayQueueSimulation |
| Find Subsequence of Length K With the Largest Sum | Easy | 57.4% | 12.5% | ArrayHash TableSorting+1 |
| Detonate the Maximum Bombs | Medium | 49.9% | 12.5% | ArrayMathDepth-First Search+3 |
| K Radius Subarray Averages | Medium | 46.0% | 12.5% | ArraySliding Window |
| Removing Minimum and Maximum From Array | Medium | 56.2% | 12.5% | ArrayGreedy |
| Find All People With Secret | Hard | 48.4% | 12.5% | Depth-First SearchBreadth-First SearchUnion-Find+2 |
| Delete the Middle Node of a Linked List | Medium | 59.5% | 12.5% | Linked ListTwo Pointers |
| Destroying Asteroids | Medium | 53.3% | 12.5% | ArrayGreedySorting |
| Maximum Employees to Be Invited to a Meeting | Hard | 61.8% | 12.5% | ArrayDynamic ProgrammingDepth-First Search+2 |
| Solving Questions With Brainpower | Medium | 60.2% | 12.5% | ArrayDynamic Programming |
| Merge Nodes in Between Zeros | Medium | 89.7% | 12.5% | Linked ListSimulation |
| Create Binary Tree From Descriptions | Medium | 81.7% | 12.5% | ArrayHash TableTree+1 |
| Minimum Bit Flips to Convert Number | Easy | 87.8% | 12.5% | Bit Manipulation |
| Number of Flowers in Full Bloom | Hard | 57.7% | 12.5% | ArrayHash TableBinary Search+3 |
| Remove Digit From Number to Maximize Result | Easy | 48.2% | 12.5% | StringGreedyEnumeration |
| Escape the Spreading Fire | Hard | 37.6% | 12.5% | ArrayBinary SearchBreadth-First Search+1 |
| Find Closest Number to Zero | Easy | 47.7% | 12.5% | Array |
| Longest Path With Different Adjacent Characters | Hard | 53.9% | 12.5% | ArrayStringTree+3 |
| Maximum Total Importance of Roads | Medium | 69.1% | 12.5% | GreedyGraph TheorySorting+1 |
| Root Equals Sum of Children | Easy | 84.8% | 12.5% | TreeBinary Tree |
| Decode the Message | Easy | 85.8% | 12.5% | Hash TableString |
| Equal Row and Column Pairs | Medium | 70.8% | 12.5% | ArrayHash TableMatrix+1 |
| Longest Cycle in a Graph | Hard | 50.4% | 12.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Longest Ideal Subsequence | Medium | 46.7% | 12.5% | Hash TableStringDynamic Programming |
| Largest Local Values in a Matrix | Easy | 87.7% | 12.5% | ArrayMatrix |
| Minimum Amount of Time to Collect Garbage | Medium | 85.1% | 12.5% | ArrayStringPrefix Sum |
| Longest Nice Subarray | Medium | 64.8% | 12.5% | ArrayBit ManipulationSliding Window |
| Smallest Even Multiple | Easy | 88.3% | 12.5% | MathNumber Theory |
| Reverse Odd Levels of Binary Tree | Medium | 86.7% | 12.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Number of Unique Subjects Taught by Each Teacher | Easy | 89.2% | 12.5% | Database |
| Find The Original Array of Prefix Xor | Medium | 88.3% | 12.5% | ArrayBit Manipulation |
| Largest Positive Integer That Exists With Its Negative | Easy | 74.5% | 12.5% | ArrayHash TableTwo Pointers+1 |
| Count Subarrays With Fixed Bounds | Hard | 69.3% | 12.5% | ArrayQueueSliding Window+1 |
| Minimize Maximum of Array | Medium | 46.5% | 12.5% | ArrayBinary SearchDynamic Programming+2 |
| Minimum Number of Operations to Make Arrays Similar | Hard | 61.5% | 12.5% | ArrayGreedySorting |
| Apply Operations to an Array | Easy | 74.7% | 12.5% | ArrayTwo PointersSimulation |
| Convert the Temperature | Easy | 90.3% | 12.5% | Math |
| Split Message Based on Limit | Hard | 42.0% | 12.5% | StringEnumeration |
| Difference Between Element Sum and Digit Sum of an Array | Easy | 85.3% | 12.5% | ArrayMath |
| Count the Number of Good Subarrays | Medium | 65.9% | 12.5% | ArrayHash TableSliding Window |
| Maximum Subsequence Score | Medium | 54.6% | 12.5% | ArrayGreedySorting+1 |
| Take Gifts From the Richest Pile | Easy | 75.5% | 12.5% | ArrayHeap (Priority Queue)Simulation |
| The Number of Beautiful Subsets | Medium | 50.9% | 12.5% | ArrayHash TableMath+4 |
| Minimize the Maximum Difference of Pairs | Medium | 50.9% | 12.5% | ArrayBinary SearchDynamic Programming+2 |
| Counter | Easy | 82.4% | 12.5% | |
| Sleep | Easy | 87.4% | 12.5% | |
| Array Prototype Last | Easy | 74.6% | 12.5% | |
| Function Composition | Easy | 86.9% | 12.5% | |
| Filter Elements from Array | Easy | 85.5% | 12.5% | |
| Apply Transform Over Each Element in Array | Easy | 86.2% | 12.5% | |
| Sliding Subarray Beauty | Medium | 36.3% | 12.5% | ArrayHash TableSliding Window |
| Extra Characters in a String | Medium | 57.3% | 12.5% | ArrayHash TableString+2 |
| Buy Two Chocolates | Easy | 68.3% | 12.5% | ArrayGreedySorting |
| Array Reduce Transformation | Easy | 85.5% | 12.5% | |
| Cache With Time Limit | Medium | 76.0% | 12.5% | |
| Find the Prefix Common Array of Two Arrays | Medium | 87.0% | 12.5% | ArrayHash TableBit Manipulation |
| Counter II | Easy | 81.2% | 12.5% | |
| Maximum Number of Moves in a Grid | Medium | 58.8% | 12.5% | ArrayDynamic ProgrammingMatrix |
| Allow One Function Call | Easy | 86.7% | 12.5% | |
| Event Emitter | Medium | 74.9% | 12.5% | |
| Painting the Walls | Hard | 48.9% | 12.5% | ArrayDynamic Programming |
| Find the Maximum Achievable Number | Easy | 91.2% | 12.5% | Math |
| Lexicographically Smallest Palindrome | Easy | 80.8% | 12.5% | Two PointersStringGreedy |
| Return Length of Arguments Passed | Easy | 94.5% | 12.5% | |
| Consecutive Transactions with Increasing Amounts | Hard | 34.5% | 12.5% | |
| Count Complete Subarrays in an Array | Medium | 75.9% | 12.5% | ArrayHash TableSliding Window |
| Continuous Subarrays | Medium | 57.9% | 12.5% | ArrayQueueSliding Window+3 |
| Number of Employees Who Met the Target | Easy | 87.8% | 12.5% | Array |
| Count Pairs Whose Sum is Less than Target | Easy | 87.7% | 12.5% | ArrayTwo PointersBinary Search+1 |
| Check if a String Is an Acronym of Words | Easy | 82.9% | 12.5% | ArrayString |
| Minimum Absolute Difference Between Elements With Constraint | Medium | 37.1% | 12.5% | ArrayBinary SearchOrdered Set |
| Find The K-th Lucky Number | Medium | 76.1% | 12.5% | |
| Maximum Odd Binary Number | Easy | 82.9% | 12.5% | MathStringGreedy |
| Display the First Three Rows | Easy | 93.1% | 12.5% | |
| Get the Size of a DataFrame | Easy | 84.9% | 12.5% | |
| Beautiful Towers II | Medium | 36.2% | 12.5% | ArrayStackMonotonic Stack |
| Count Visited Nodes in a Directed Graph | Hard | 30.2% | 12.5% | Dynamic ProgrammingGraph TheoryMemoization |
| Find Words Containing Character | Easy | 90.4% | 12.5% | ArrayString |
| Count Subarrays Where Max Element Appears at Least K Times | Medium | 62.4% | 12.5% | ArraySliding Window |
| Length of Longest Subarray With at Most K Frequency | Medium | 56.4% | 12.5% | ArrayHash TableSliding Window |
| Minimum Number Game | Easy | 85.3% | 12.5% | ArraySortingHeap (Priority Queue)+1 |
| Divide Array Into Arrays With Max Difference | Medium | 79.0% | 12.5% | ArrayGreedySorting |
| Minimum Number of Operations to Make Array XOR Equal to K | Medium | 85.5% | 12.5% | ArrayBit Manipulation |
| Minimize Manhattan Distances | Hard | 32.7% | 12.5% | ArrayMathGeometry+2 |
| Minimum Cost Walk in Weighted Graph | Hard | 68.3% | 12.5% | ArrayBit ManipulationUnion-Find+1 |
| Minimum Array End | Medium | 55.4% | 12.5% | Bit Manipulation |
| Minimum Cost to Equalize Array | Hard | 18.7% | 12.5% | ArrayGreedyEnumeration |
| Minimum Substring Partition of Equal Character Frequency | Medium | 40.0% | 12.5% | Hash TableStringDynamic Programming+1 |
| Special Array II | Medium | 45.8% | 12.5% | ArrayBinary SearchPrefix Sum |
| Special Array I | Easy | 81.6% | 12.5% | Array |
| Find the Number of Good Pairs II | Medium | 26.6% | 12.5% | ArrayHash Table |
| Find the Maximum Length of Valid Subsequence II | Medium | 57.2% | 12.5% | ArrayDynamic Programming |
| Group Sold Products By The Date | Easy | 77.9% | 12.5% | Database |
| Longest Turbulent Subarray | Medium | 48.9% | 12.5% | ArrayDynamic ProgrammingSliding Window |
| Sort the Jumbled Numbers | Medium | 60.0% | 12.5% | ArraySorting |
| Nth Digit | Medium | 37.1% | 12.5% | MathBinary Search |
| Primary Department for Each Employee | Easy | 73.9% | 12.5% | Database |
| Minimum Cost to Convert String I | Medium | 63.3% | 12.5% | ArrayStringGraph Theory+1 |
| Count the Number of Complete Components | Medium | 77.7% | 12.5% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Brightest Position on Street | Medium | 60.6% | 12.5% | |
| Minimum Moves to Spread Stones Over Grid | Medium | 45.3% | 12.5% | ArrayDynamic ProgrammingBacktracking+3 |
| Minimum Deletions to Make String Balanced | Medium | 68.2% | 12.5% | StringDynamic ProgrammingStack |
| Valid Palindrome III | Hard | 49.1% | 12.5% | |
| Make Two Arrays Equal by Reversing Subarrays | Easy | 75.8% | 12.5% | ArrayHash TableSorting |
| Super Ugly Number | Medium | 45.9% | 12.5% | ArrayMathDynamic Programming |
| Range Sum of Sorted Subarray Sums | Medium | 63.1% | 12.5% | ArrayTwo PointersBinary Search+2 |
| Minimum Interval to Include Each Query | Hard | 53.9% | 12.5% | ArrayBinary SearchSweep Line+2 |
| Task Scheduler II | Medium | 54.7% | 12.5% | ArrayHash TableSimulation |
| Minimum Cost to Convert String II | Hard | 59.7% | 12.5% | ArrayStringDynamic Programming+3 |
| Split a String in Balanced Strings | Easy | 87.3% | 12.5% | StringGreedyCounting |
| Finding 3-Digit Even Numbers | Easy | 78.8% | 12.5% | ArrayHash TableRecursion+2 |
| Reverse Nodes in Even Length Groups | Medium | 63.6% | 12.5% | Linked List |
| Minimum Number of Days to Disconnect Island | Hard | 58.8% | 12.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Check if the Rectangle Corner Is Reachable | Hard | 25.3% | 12.5% | ArrayMathDepth-First Search+3 |
| Modify Columns | Easy | 92.4% | 12.5% | |
| Valid Word | Easy | 50.9% | 12.5% | String |
| Minimum Fuel Cost to Report to the Capital | Medium | 64.7% | 12.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Water and Jug Problem | Medium | 44.8% | 12.5% | MathDepth-First SearchBreadth-First Search |
| Maximum Distance in Arrays | Medium | 45.6% | 12.5% | ArrayGreedy |
| Minimum Index Sum of Two Lists | Easy | 59.4% | 12.5% | ArrayHash TableString |
| Length of the Longest Subsequence That Sums to Target | Medium | 39.3% | 12.5% | ArrayDynamic Programming |
| Maximum Number of Points with Cost | Medium | 41.8% | 12.5% | ArrayDynamic ProgrammingMatrix |
| Find Servers That Handled Most Number of Requests | Hard | 45.2% | 12.5% | ArrayHeap (Priority Queue)Simulation+1 |
| Parse Lisp Expression | Hard | 53.5% | 12.5% | Hash TableStringStack+1 |
| Minimum Operations to Make Binary Array Elements Equal to One I | Medium | 80.4% | 12.5% | ArrayBit ManipulationQueue+2 |
| N-ary Tree Postorder Traversal | Easy | 81.0% | 12.5% | StackTreeDepth-First Search |
| Fraction Addition and Subtraction | Medium | 66.4% | 12.5% | MathStringSimulation |
| Degree of an Array | Easy | 58.2% | 12.5% | ArrayHash Table |
| Add to Array-Form of Integer | Easy | 45.4% | 12.5% | ArrayMath |
| Minimum Additions to Make Valid String | Medium | 51.0% | 12.5% | StringDynamic ProgrammingStack+1 |
| HTML Entity Parser | Medium | 50.3% | 12.5% | Hash TableString |
| Subarray With Elements Greater Than Varying Threshold | Hard | 45.2% | 12.5% | ArrayStackUnion-Find+1 |
| Find Elements in a Contaminated Binary Tree | Medium | 84.1% | 12.5% | Hash TableTreeDepth-First Search+3 |
| Out of Boundary Paths | Medium | 48.4% | 12.5% | Dynamic Programming |
| Dinner Plate Stacks | Hard | 33.4% | 12.5% | Hash TableStackDesign+1 |
| Maximize Score of Numbers in Ranges | Medium | 35.5% | 12.5% | ArrayBinary SearchGreedy+1 |
| Insert Greatest Common Divisors in Linked List | Medium | 91.5% | 12.5% | Linked ListMathNumber Theory |
| Check if Two Chessboard Squares Have the Same Color | Easy | 72.2% | 12.5% | MathString |
| Longest Continuous Increasing Subsequence | Easy | 51.8% | 12.5% | Array |
| Valid Tic-Tac-Toe State | Medium | 34.7% | 12.5% | ArrayMatrix |
| Longest Strictly Increasing or Strictly Decreasing Subarray | Easy | 64.9% | 12.5% | Array |
| Lexicographically Smallest String After Substring Operation | Medium | 34.5% | 12.5% | StringGreedy |
| Minimum Operations to Make All Array Elements Equal | Medium | 37.9% | 12.5% | ArrayBinary SearchSorting+1 |
| Count Nodes With the Highest Score | Medium | 52.5% | 12.5% | ArrayTreeDepth-First Search+1 |
| Find the Longest Substring Containing Vowels in Even Counts | Medium | 75.7% | 12.5% | Hash TableStringBit Manipulation+1 |
| Count the Number of Inversions | Hard | 29.7% | 12.5% | ArrayDynamic Programming |
| Uncommon Words from Two Sentences | Easy | 75.6% | 12.5% | Hash TableStringCounting |
| Two Sum III - Data structure design | Easy | 39.1% | 12.5% | |
| Sort By | Easy | 83.2% | 12.5% | |
| Maximum of Absolute Value Expression | Medium | 48.6% | 12.5% | ArrayMath |
| Number of Good Ways to Split a String | Medium | 68.4% | 12.5% | Hash TableStringDynamic Programming+1 |
| Minimum Obstacle Removal to Reach Corner | Hard | 70.4% | 12.5% | ArrayBreadth-First SearchGraph Theory+3 |
| All Ancestors of a Node in a Directed Acyclic Graph | Medium | 62.1% | 12.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Largest Sum of Averages | Medium | 54.8% | 12.5% | ArrayDynamic ProgrammingPrefix Sum |
| Lexicographically Smallest String After Applying Operations | Medium | 79.4% | 12.5% | StringDepth-First SearchBreadth-First Search+1 |
| The Latest Time to Catch a Bus | Medium | 29.9% | 12.5% | ArrayTwo PointersBinary Search+1 |
| Web Crawler | Medium | 68.9% | 12.5% | |
| Encrypt and Decrypt Strings | Hard | 38.0% | 12.5% | ArrayHash TableString+2 |
| Robot Collisions | Hard | 56.1% | 12.5% | ArrayStackSorting+1 |
| Find the Length of the Longest Common Prefix | Medium | 57.0% | 12.5% | ArrayHash TableString+1 |
| Sum of Prefix Scores of Strings | Hard | 60.8% | 12.5% | ArrayStringTrie+1 |
| String Compression III | Medium | 67.0% | 12.5% | String |
| Design Circular Deque | Medium | 64.4% | 12.5% | ArrayLinked ListDesign+1 |
| Rank Transform of an Array | Easy | 70.8% | 12.5% | ArrayHash TableSorting |
| Biggest Single Number | Easy | 70.9% | 12.5% | Database |
| Minimize Max Distance to Gas Station | Hard | 53.9% | 12.5% | |
| Divide Players Into Teams of Equal Skill | Medium | 68.9% | 12.5% | ArrayHash TableTwo Pointers+1 |
| Distribute Elements Into Two Arrays I | Easy | 73.8% | 12.5% | ArraySimulation |
| Sentence Similarity III | Medium | 48.5% | 12.5% | ArrayTwo PointersString |
| Number of Changing Keys | Easy | 80.5% | 12.5% | String |
| Minimum String Length After Removing Substrings | Easy | 77.1% | 12.5% | StringStackSimulation |
| Minimum Insertions to Balance a Parentheses String | Medium | 53.5% | 12.5% | StringStackGreedy |
| Finding MK Average | Hard | 38.7% | 12.5% | DesignQueueHeap (Priority Queue)+2 |
| Word Pattern II | Medium | 48.8% | 12.5% | |
| Last Stone Weight II | Medium | 59.3% | 12.5% | ArrayDynamic Programming |
| Divide Intervals Into Minimum Number of Groups | Medium | 63.6% | 12.5% | ArrayTwo PointersGreedy+3 |
| Prime Palindrome | Medium | 27.9% | 12.5% | MathNumber Theory |
| Reshape the Matrix | Easy | 64.7% | 12.5% | ArrayMatrixSimulation |
| The Maze | Medium | 60.3% | 12.5% | |
| Random Pick with Blacklist | Hard | 34.6% | 12.5% | ArrayHash TableMath+3 |
| Maximal Score After Applying K Operations | Medium | 64.0% | 12.5% | ArrayGreedyHeap (Priority Queue) |
| Numbers With Same Consecutive Differences | Medium | 59.1% | 12.5% | BacktrackingBreadth-First Search |
| Separate Black and White Balls | Medium | 64.0% | 12.5% | Two PointersStringGreedy |
| Rearrange String k Distance Apart | Hard | 39.5% | 12.5% | |
| Count Number of Maximum Bitwise-OR Subsets | Medium | 89.6% | 12.5% | ArrayBacktrackingBit Manipulation+1 |
| Complete Binary Tree Inserter | Medium | 65.0% | 12.5% | TreeBreadth-First SearchDesign+1 |
| Split a String Into the Max Number of Unique Substrings | Medium | 68.6% | 12.5% | Hash TableStringBacktracking |
| Minimum Subsequence in Non-Increasing Order | Easy | 73.6% | 12.5% | ArrayGreedySorting |
| Sort the People | Easy | 84.8% | 12.5% | ArrayHash TableString+1 |
| First and Last Call On the Same Day | Hard | 51.0% | 12.5% | |
| Minimum Division Operations to Make Array Non Decreasing | Medium | 29.1% | 12.5% | ArrayMathGreedy+1 |
| Finding the Users Active Minutes | Medium | 80.8% | 12.5% | ArrayHash Table |
| The Most Recent Orders for Each Product | Medium | 65.0% | 12.5% | |
| Design Log Storage System | Medium | 59.2% | 12.5% | |
| Find Occurrences of an Element in an Array | Medium | 73.2% | 12.5% | ArrayHash Table |
| Grid Game | Medium | 60.9% | 12.5% | ArrayMatrixPrefix Sum |
| Strobogrammatic Number II | Medium | 53.5% | 12.5% | |
| Lexicographically Smallest Beautiful String | Hard | 38.1% | 12.5% | StringGreedy |
| Find if Array Can Be Sorted | Medium | 66.5% | 12.5% | ArrayBit ManipulationSorting |
| Largest Combination With Bitwise AND Greater Than Zero | Medium | 80.8% | 12.5% | ArrayHash TableBit Manipulation+1 |
| Simple Bank System | Medium | 69.8% | 12.5% | ArrayHash TableDesign+1 |
| Shortest Uncommon Substring in an Array | Medium | 50.0% | 12.5% | ArrayHash TableString+1 |
| Prime Subtraction Operation | Medium | 55.6% | 12.5% | ArrayMathBinary Search+2 |
| Shortest Subarray With OR at Least K II | Medium | 50.2% | 12.5% | ArrayBit ManipulationSliding Window |
| Most Beautiful Item for Each Query | Medium | 62.1% | 12.5% | ArrayBinary SearchSorting |
| DI String Match | Easy | 80.9% | 12.5% | ArrayTwo PointersString+1 |
| Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | Medium | 72.1% | 12.5% | ArraySliding Window |
| Final Array State After K Multiplication Operations I | Easy | 87.0% | 12.5% | ArrayMathHeap (Priority Queue)+1 |
| Length of the Longest Alphabetical Continuous Substring | Medium | 60.3% | 12.5% | String |
| Check if Number is a Sum of Powers of Three | Medium | 79.4% | 12.5% | Math |
| Adjacent Increasing Subarrays Detection I | Easy | 48.0% | 12.5% | Array |
| The Maze II | Medium | 55.0% | 12.5% | |
| Take K of Each Character From Left and Right | Medium | 51.5% | 12.5% | Hash TableStringSliding Window |
| High-Access Employees | Medium | 47.3% | 12.5% | ArrayHash TableString+1 |
| Flip Columns For Maximum Number of Equal Rows | Medium | 78.6% | 12.5% | ArrayHash TableMatrix |
| Reshape Data: Pivot | Easy | 83.2% | 12.5% | |
| Maximum Number of Removable Characters | Medium | 46.8% | 12.5% | ArrayTwo PointersString+1 |
| Number of Paths with Max Score | Hard | 42.0% | 12.5% | ArrayDynamic ProgrammingMatrix |
| Zigzag Iterator | Medium | 66.5% | 12.5% | |
| Minimum Operations to Make a Subsequence | Hard | 49.6% | 12.5% | ArrayHash TableBinary Search+1 |
| Minimum Time to Visit a Cell In a Grid | Hard | 56.3% | 12.5% | ArrayBreadth-First SearchGraph Theory+3 |
| Valid Arrangement of Pairs | Hard | 66.5% | 12.5% | ArrayDepth-First SearchGraph Theory+1 |
| The Most Frequently Ordered Products for Each Customer | Medium | 77.7% | 12.5% | |
| Check If a Word Occurs As a Prefix of Any Word in a Sentence | Easy | 68.8% | 12.5% | Two PointersStringString Matching |
| Parallel Courses III | Hard | 66.8% | 12.5% | ArrayDynamic ProgrammingGraph Theory+1 |
| Find Longest Special Substring That Occurs Thrice I | Medium | 61.9% | 12.5% | Hash TableStringBinary Search+2 |
| Jump Game VII | Medium | 26.3% | 12.5% | StringDynamic ProgrammingSliding Window+1 |
| Find Score of an Array After Marking All Elements | Medium | 64.5% | 12.5% | ArrayHash TableSorting+2 |
| Largest 1-Bordered Square | Medium | 52.0% | 12.5% | ArrayDynamic ProgrammingMatrix |
| Minimum Operations to Make Array Equal to Target | Hard | 41.3% | 12.5% | ArrayDynamic ProgrammingStack+2 |
| Sum of Unique Elements | Easy | 79.8% | 12.5% | ArrayHash TableCounting |
| Maximum Number of K-Divisible Components | Hard | 74.1% | 12.5% | TreeDepth-First Search |
| Find Building Where Alice and Bob Can Meet | Hard | 52.2% | 12.5% | ArrayBinary SearchStack+4 |
| Maximum Strength of K Disjoint Subarrays | Hard | 27.5% | 12.5% | ArrayDynamic ProgrammingPrefix Sum |
| Count Collisions on a Road | Medium | 58.1% | 12.5% | StringStackSimulation |
| Button with Longest Push Time | Easy | 41.0% | 12.5% | Array |
| All People Report to the Given Manager | Medium | 84.0% | 12.5% | |
| Best Sightseeing Pair | Medium | 62.7% | 12.5% | ArrayDynamic Programming |
| Maximum Sum of 3 Non-Overlapping Subarrays | Hard | 59.7% | 12.5% | ArrayDynamic ProgrammingSliding Window+1 |
| Count Ways To Build Good Strings | Medium | 59.0% | 12.5% | Dynamic Programming |
| Special Binary String | Hard | 75.8% | 12.5% | StringDivide and ConquerSorting |
| Nim Game | Easy | 59.2% | 12.5% | MathBrainteaserGame Theory |
| Shifting Letters II | Medium | 53.5% | 12.5% | ArrayStringPrefix Sum |
| Rearrange Array to Maximize Prefix Score | Medium | 42.5% | 12.5% | ArrayGreedySorting+1 |
| Largest Element in an Array after Merge Operations | Medium | 47.6% | 12.5% | ArrayGreedy |
| Employee Importance | Medium | 69.3% | 12.5% | ArrayHash TableTree+2 |
| Maximum Coins From K Consecutive Bags | Medium | 24.5% | 12.5% | ArrayBinary SearchGreedy+3 |
| Construct K Palindrome Strings | Medium | 68.6% | 12.5% | Hash TableStringGreedy+1 |
| Minimum Length of String After Operations | Medium | 75.0% | 12.5% | Hash TableStringCounting |
| Find Users With Valid E-Mails | Easy | 36.8% | 12.5% | Database |
| Minimize XOR | Medium | 62.4% | 12.5% | GreedyBit Manipulation |
| Neighboring Bitwise XOR | Medium | 79.8% | 12.5% | ArrayBit Manipulation |
| Minimum Cost to Make at Least One Valid Path in a Grid | Hard | 70.9% | 12.5% | ArrayBreadth-First SearchGraph Theory+3 |
| Paint House IV | Medium | 45.0% | 12.5% | ArrayDynamic Programming |
| Tree Diameter | Medium | 61.2% | 12.5% | |
| Map of Highest Peak | Medium | 75.6% | 12.5% | ArrayBreadth-First SearchMatrix |
| Most Profitable Path in a Tree | Medium | 67.3% | 12.5% | ArrayTreeDepth-First Search+2 |
| Minimum Time to Collect All Apples in a Tree | Medium | 63.5% | 12.5% | Hash TableTreeDepth-First Search+1 |
| Maximum Performance of a Team | Hard | 47.7% | 12.5% | ArrayGreedySorting+1 |
| Make Lexicographically Smallest Array by Swapping Elements | Medium | 60.2% | 12.5% | ArrayUnion-FindSorting |
| Maximum Subarray Min-Product | Medium | 40.0% | 12.5% | ArrayStackMonotonic Stack+1 |
| Maximum XOR After Operations | Medium | 79.9% | 12.5% | ArrayMathBit Manipulation |
| Number of Even and Odd Bits | Easy | 73.3% | 12.5% | Bit Manipulation |
| Maximum Number of Fish in a Grid | Medium | 70.5% | 12.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Maximum Tastiness of Candy Basket | Medium | 67.9% | 12.5% | ArrayBinary SearchGreedy+1 |
| Delete Columns to Make Sorted | Easy | 78.0% | 12.5% | ArrayString |
| Maximum Possible Number by Binary Concatenation | Medium | 65.3% | 12.5% | ArrayBit ManipulationEnumeration |
| Maximum Ascending Subarray Sum | Easy | 66.3% | 12.5% | Array |
| Design Snake Game | Medium | 40.0% | 12.5% | |
| Even Odd Tree | Medium | 67.0% | 12.5% | TreeBreadth-First SearchBinary Tree |
| Apply Operations to Make All Array Elements Equal to Zero | Medium | 33.2% | 12.5% | ArrayPrefix Sum |
| Max Chunks To Make Sorted II | Hard | 54.7% | 12.5% | ArrayStackGreedy+2 |
| Tuple with Same Product | Medium | 70.1% | 12.5% | ArrayHash TableCounting |
| Find the Number of Distinct Colors Among the Balls | Medium | 54.2% | 12.5% | ArrayHash TableSimulation |
| Number of Subarrays with Bounded Maximum | Medium | 54.7% | 12.5% | ArrayTwo Pointers |
| Stock Price Fluctuation | Medium | 48.9% | 12.5% | Hash TableDesignHeap (Priority Queue)+2 |
| Maximize the Minimum Game Score | Hard | 26.0% | 12.5% | ArrayBinary SearchGreedy |
| Clear Digits | Easy | 82.7% | 12.5% | StringStackSimulation |
| Maximum Sum With Exactly K Elements | Easy | 80.5% | 12.5% | ArrayGreedy |
| Design Excel Sum Formula | Hard | 39.8% | 12.5% | |
| Maximum Good Subarray Sum | Medium | 21.4% | 12.5% | ArrayHash TablePrefix Sum |
| Minimum Operations to Exceed Threshold Value II | Medium | 45.8% | 12.5% | ArrayHeap (Priority Queue)Simulation |
| Escape a Large Maze | Hard | 36.3% | 12.5% | ArrayHash TableDepth-First Search+1 |
| Minimum Score of a Path Between Two Cities | Medium | 58.5% | 12.5% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Largest Values From Labels | Medium | 64.0% | 12.5% | ArrayHash TableGreedy+2 |
| Find the Punishment Number of an Integer | Medium | 81.7% | 12.5% | MathBacktracking |
| The k-th Lexicographical String of All Happy Strings of Length n | Medium | 85.3% | 12.5% | StringBacktracking |
| Range Addition | Medium | 72.9% | 12.5% | |
| Check if Matrix Is X-Matrix | Easy | 66.4% | 12.5% | ArrayMatrix |
| Self Dividing Numbers | Easy | 80.5% | 12.5% | Math |
| Divide Nodes Into the Maximum Number of Groups | Hard | 67.0% | 12.5% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Separate Squares I | Medium | 58.0% | 12.5% | ArrayBinary Search |
| Select K Disjoint Special Substrings | Medium | 19.0% | 12.5% | Hash TableStringDynamic Programming+2 |
| Maximum Sum of Two Non-Overlapping Subarrays | Medium | 60.7% | 12.5% | ArrayDynamic ProgrammingSliding Window |
| Minimum Operations to Make the Array Increasing | Easy | 81.8% | 12.5% | ArrayGreedy |
| Count Univalue Subtrees | Medium | 57.5% | 12.5% | |
| Maximum Absolute Sum of Any Subarray | Medium | 71.2% | 12.5% | ArrayDynamic Programming |
| Number of Sub-arrays With Odd Sum | Medium | 55.8% | 12.5% | ArrayMathDynamic Programming+1 |
| Bitwise ORs of Subarrays | Medium | 56.8% | 12.5% | ArrayDynamic ProgrammingBit Manipulation |
| Separate Squares II | Hard | 60.0% | 12.5% | ArrayBinary SearchSegment Tree+1 |
| Length of Longest Fibonacci Subsequence | Medium | 57.5% | 12.5% | ArrayHash TableDynamic Programming |
| Verify Preorder Serialization of a Binary Tree | Medium | 47.1% | 12.5% | StringStackTree+1 |
| Robot Return to Origin | Easy | 76.5% | 12.5% | StringSimulation |
| Rank Teams by Votes | Medium | 60.0% | 12.5% | ArrayHash TableString+2 |
| Insertion Sort List | Medium | 58.5% | 12.5% | Linked ListSorting |
| Sentence Similarity II | Medium | 51.1% | 12.5% | |
| Count Total Number of Colored Cells | Medium | 66.1% | 12.5% | Math |
| Maximum Number of Consecutive Values You Can Make | Medium | 63.5% | 12.5% | ArrayGreedySorting |
| Detect Cycles in 2D Grid | Medium | 52.4% | 12.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Closest Prime Numbers in Range | Medium | 51.7% | 12.5% | MathNumber Theory |
| Minimum Recolors to Get K Consecutive Black Blocks | Easy | 68.6% | 12.5% | StringSliding Window |
| Maximum Number of Integers to Choose From a Range I | Medium | 68.0% | 12.5% | ArrayHash TableBinary Search+2 |
| Sliding Puzzle | Hard | 74.1% | 12.5% | ArrayDynamic ProgrammingBacktracking+3 |
| Find Duplicate File in System | Medium | 67.6% | 12.5% | ArrayHash TableString |
| Zero Array Transformation II | Medium | 43.6% | 12.5% | ArrayBinary SearchPrefix Sum |
| N-ary Tree Preorder Traversal | Easy | 76.6% | 12.5% | StackTreeDepth-First Search |
| Evaluate Boolean Binary Tree | Easy | 82.4% | 12.5% | TreeDepth-First SearchBinary Tree |
| Minimum Positive Sum Subarray | Easy | 44.8% | 12.5% | ArraySliding WindowPrefix Sum |
| Minimum Time to Repair Cars | Medium | 59.6% | 12.5% | ArrayBinary Search |
| Divide Array Into Equal Pairs | Easy | 79.2% | 12.5% | ArrayHash TableBit Manipulation+1 |
| Parallel Courses | Medium | 62.0% | 12.5% | |
| Find Common Elements Between Two Arrays | Easy | 84.4% | 12.5% | ArrayHash Table |
| Data Stream as Disjoint Intervals | Hard | 60.0% | 12.5% | Hash TableBinary SearchUnion-Find+3 |
| Count Vowel Substrings of a String | Easy | 72.8% | 12.5% | Hash TableString |
| Count Palindromic Subsequences | Hard | 41.0% | 12.5% | StringDynamic Programming |
| Find the Kth Smallest Sum of a Matrix With Sorted Rows | Hard | 62.3% | 12.5% | ArrayBinary SearchHeap (Priority Queue)+1 |
| Minimum Absolute Difference | Easy | 75.0% | 12.5% | ArraySorting |
| Count Days Without Meetings | Medium | 48.1% | 12.5% | ArraySorting |
| Check if Grid can be Cut into Sections | Medium | 68.3% | 12.5% | ArraySorting |
| Minimum Index of a Valid Split | Medium | 75.5% | 12.5% | ArrayHash TableSorting |
| Maximum Score of Non-overlapping Intervals | Hard | 31.0% | 12.5% | ArrayBinary SearchDynamic Programming+1 |
| Teemo Attacking | Easy | 57.5% | 12.5% | ArraySimulation |
| Count of Substrings Containing Every Vowel and K Consonants II | Medium | 40.6% | 12.5% | Hash TableStringSliding Window |
| Possible Bipartition | Medium | 52.3% | 12.5% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Remove Stones to Minimize the Total | Medium | 65.5% | 12.5% | ArrayGreedyHeap (Priority Queue) |
| Maximum Value of an Ordered Triplet II | Medium | 56.4% | 12.5% | Array |
| Customer Purchasing Behavior Analysis | Medium | 36.4% | 12.5% | |
| Market Analysis I | Medium | 57.2% | 12.5% | Database |
| Number of Subarrays That Match a Pattern I | Medium | 68.4% | 12.5% | ArrayRolling HashString Matching+1 |
| Minimum Distance to the Target Element | Easy | 54.2% | 12.5% | Array |
| Unique 3-Digit Even Numbers | Easy | 69.1% | 12.5% | ArrayHash TableRecursion+1 |
| Binary Tree Tilt | Easy | 65.3% | 12.5% | TreeDepth-First SearchBinary Tree |
| Describe the Painting | Medium | 51.9% | 12.5% | ArrayHash TableSorting+1 |
| String Without AAA or BBB | Medium | 45.0% | 12.5% | StringGreedy |
| Number of Adjacent Elements With the Same Color | Medium | 58.1% | 12.5% | Array |
| Alternating Groups I | Easy | 68.8% | 12.5% | ArraySliding Window |
| Number of Pairs Satisfying Inequality | Hard | 46.8% | 12.5% | ArrayBinary SearchDivide and Conquer+4 |
| Zuma Game | Hard | 30.2% | 12.5% | StringDynamic ProgrammingStack+2 |
| Merge Two 2D Arrays by Summing Values | Easy | 81.8% | 12.5% | ArrayHash TableTwo Pointers |
| Closest Binary Search Tree Value | Easy | 49.3% | 12.5% | |
| Pizza Toppings Cost Analysis | Medium | 67.3% | 12.5% | |
| Finding Pairs With a Certain Sum | Medium | 61.6% | 12.5% | ArrayHash TableDesign |
| Expression Add Operators | Hard | 42.8% | 12.5% | MathStringBacktracking |
| Count the Number of Ideal Arrays | Hard | 56.9% | 12.5% | MathDynamic ProgrammingCombinatorics+1 |
| Count Subarrays With Score Less Than K | Hard | 62.3% | 12.5% | ArrayBinary SearchSliding Window+1 |
| Find the Middle Index in Array | Easy | 69.1% | 12.5% | ArrayPrefix Sum |
| Binary Watch | Easy | 65.1% | 12.5% | BacktrackingBit Manipulation |
| Maximum Number of Tasks You Can Assign | Hard | 50.2% | 12.5% | ArrayTwo PointersBinary Search+4 |
| Push Dominoes | Medium | 63.0% | 12.5% | Two PointersStringDynamic Programming |
| Minimum Domino Rotations For Equal Row | Medium | 56.5% | 12.5% | ArrayGreedy |
| Range Sum Query 2D - Mutable | Medium | 45.4% | 12.5% | |
| Maximum Profit From Trading Stocks | Medium | 48.0% | 12.5% | |
| Find Minimum Time to Reach Last Room II | Medium | 67.9% | 12.5% | ArrayGraph TheoryHeap (Priority Queue)+2 |
| Minimum Equal Sum of Two Arrays After Replacing Zeros | Medium | 50.2% | 12.5% | ArrayGreedy |
| Minimum Number of Swaps to Make the Binary String Alternating | Medium | 43.8% | 12.5% | StringGreedy |
| Total Characters in String After Transformations I | Medium | 45.7% | 12.5% | Hash TableMathString+2 |
| Find the Longest Balanced Substring of a Binary String | Easy | 46.4% | 12.5% | String |
| Minimum Amount of Damage Dealt to Bob | Hard | 39.5% | 12.5% | ArrayGreedySorting |
| Painting a Grid With Three Different Colors | Hard | 77.3% | 12.5% | Dynamic Programming |
| Number of Segments in a String | Easy | 36.9% | 12.5% | String |
| Zero Array Transformation I | Medium | 54.4% | 12.5% | ArrayPrefix Sum |
| Minimum Cuts to Divide a Circle | Easy | 56.0% | 12.5% | MathGeometry |
| Manhattan Distances of All Arrangements of Pieces | Hard | 35.1% | 12.5% | MathCombinatorics |
| Count Collisions of Monkeys on a Polygon | Medium | 29.9% | 12.5% | MathRecursion |
| Minimum Cost to Make Arrays Identical | Medium | 37.7% | 12.5% | ArrayGreedySorting |
| Divisible and Non-divisible Sums Difference | Easy | 91.0% | 12.5% | Math |
| Integer Replacement | Medium | 37.1% | 12.5% | Dynamic ProgrammingGreedyBit Manipulation+1 |
| Max Pair Sum in an Array | Easy | 60.4% | 12.5% | ArrayHash Table |
| Maximum Height by Stacking Cuboids | Hard | 61.7% | 12.5% | ArrayDynamic ProgrammingSorting |
| Pizza With 3n Slices | Hard | 53.7% | 12.5% | ArrayDynamic ProgrammingGreedy+1 |
| Find Closest Node to Given Two Nodes | Medium | 53.0% | 12.5% | Depth-First SearchGraph Theory |
| Tiling a Rectangle with the Fewest Squares | Hard | 54.8% | 12.5% | Backtracking |
| Lexicographically Smallest Equivalent String | Medium | 81.1% | 12.5% | StringUnion-Find |
| Find the Lexicographically Largest String From the Box I | Medium | 41.0% | 12.5% | Two PointersStringEnumeration |
| Count Beautiful Splits in an Array | Medium | 18.6% | 12.5% | ArrayDynamic Programming |
| Binary Tree Longest Consecutive Sequence | Medium | 54.6% | 12.5% | |
| Maximum Value of an Ordered Triplet I | Easy | 58.2% | 12.5% | Array |
| Average of Levels in Binary Tree | Easy | 74.7% | 12.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Maximum Difference Between Even and Odd Frequency I | Easy | 60.7% | 12.5% | Hash TableStringCounting |
| Zero Array Transformation III | Medium | 54.9% | 12.5% | ArrayGreedySorting+2 |
| Maximum Difference Between Even and Odd Frequency II | Hard | 48.7% | 12.5% | StringSliding WindowEnumeration+1 |
| Maximum Difference Between Adjacent Elements in a Circular Array | Easy | 75.7% | 12.5% | Array |
| Two Out of Three | Easy | 77.4% | 12.5% | ArrayHash TableBit Manipulation |
| Max Difference You Can Get From Changing an Integer | Medium | 48.8% | 12.5% | MathGreedy |
| Maximum Difference Between Increasing Elements | Easy | 66.4% | 12.5% | Array |
| Year on Year Growth Rate | Hard | 50.9% | 12.5% | |
| Count the Number of Arrays with K Matching Adjacent Elements | Hard | 58.4% | 12.5% | MathCombinatorics |
| Maximum XOR for Each Query | Medium | 84.8% | 12.5% | ArrayBit ManipulationPrefix Sum |
| Surface Area of 3D Shapes | Easy | 70.4% | 12.5% | ArrayMathGeometry+1 |
| Check if All Characters Have Equal Number of Occurrences | Easy | 79.4% | 12.5% | Hash TableStringCounting |
| Find All K-Distant Indices in an Array | Easy | 77.4% | 12.5% | ArrayTwo Pointers |
| Check if All the Integers in a Range Are Covered | Easy | 50.8% | 12.5% | ArrayHash TablePrefix Sum |
| Number of Common Factors | Easy | 79.9% | 12.5% | MathEnumerationNumber Theory |
| Kth Smallest Product of Two Sorted Arrays | Hard | 48.9% | 12.5% | ArrayBinary Search |
| Find Smallest Common Element in All Rows | Medium | 76.8% | 12.5% | |
| Count Nodes Equal to Average of Subtree | Medium | 86.7% | 12.5% | TreeDepth-First SearchBinary Tree |
| Delete Greatest Value in Each Row | Easy | 79.8% | 12.5% | ArraySortingHeap (Priority Queue)+2 |
| Longest Binary Subsequence Less Than or Equal to K | Medium | 52.8% | 12.5% | StringDynamic ProgrammingGreedy+1 |
| Minimum Distance Between BST Nodes | Easy | 61.1% | 12.5% | TreeDepth-First SearchBreadth-First Search+2 |
| Longest Subsequence Repeated k Times | Hard | 71.3% | 12.5% | Hash TableTwo PointersString+3 |
| Minimum Cost to Reach Destination in Time | Hard | 41.1% | 12.5% | ArrayDynamic ProgrammingGraph Theory |
| Minimum Time to Complete Trips | Medium | 39.6% | 12.5% | ArrayBinary Search |
| Find the Original Typed String I | Easy | 72.1% | 12.5% | String |
| Find the Original Typed String II | Hard | 45.6% | 12.5% | StringDynamic ProgrammingPrefix Sum |
| Find the K-th Character in String Game I | Easy | 81.6% | 12.5% | MathBit ManipulationRecursion+1 |
| Longest Nice Substring | Easy | 63.7% | 12.5% | Hash TableStringDivide and Conquer+2 |
| Find the K-th Character in String Game II | Hard | 48.5% | 12.5% | MathBit ManipulationRecursion |
| Longest Common Prefix Between Adjacent Strings After Removals | Medium | 32.3% | 12.5% | ArrayString |
| Minimum Cost to Move Chips to The Same Position | Easy | 72.7% | 12.5% | ArrayMathGreedy |
| Shortest Distance to a Character | Easy | 72.6% | 12.5% | ArrayTwo PointersString |
| Reschedule Meetings for Maximum Free Time I | Medium | 53.9% | 12.5% | ArrayGreedySliding Window |
| Number of Islands II | Hard | 40.4% | 12.5% | |
| Kth Smallest Instructions | Hard | 44.6% | 12.5% | ArrayMathDynamic Programming+1 |
| Reschedule Meetings for Maximum Free Time II | Medium | 60.4% | 12.5% | ArrayGreedyEnumeration |
| Mirror Reflection | Medium | 61.9% | 12.5% | MathGeometryNumber Theory |
| The Earliest and Latest Rounds Where Players Compete | Hard | 72.7% | 12.5% | Dynamic ProgrammingMemoization |
| Number of Pairs of Interchangeable Rectangles | Medium | 52.4% | 12.5% | ArrayHash TableMath+2 |
| Maximum Beauty of an Array After Applying Operation | Medium | 58.3% | 12.5% | ArrayBinary SearchSliding Window+1 |
| Cherry Pickup | Hard | 39.1% | 12.5% | ArrayDynamic ProgrammingMatrix |
| Fix Names in a Table | Easy | 60.6% | 12.5% | Database |
| Minimum Operations to Reduce an Integer to 0 | Medium | 61.0% | 12.5% | Dynamic ProgrammingGreedyBit Manipulation |
| Minimize Malware Spread | Hard | 42.9% | 12.5% | ArrayHash TableDepth-First Search+3 |
| Consecutive Numbers Sum | Hard | 42.6% | 12.5% | MathEnumeration |
| Find Special Substring of Length K | Easy | 35.1% | 12.5% | String |
| X of a Kind in a Deck of Cards | Easy | 30.1% | 12.5% | ArrayHash TableMath+2 |
| Game Play Analysis II | Easy | 54.5% | 12.5% | |
| Construct the Rectangle | Easy | 63.0% | 12.5% | Math |
| Delete Characters to Make Fancy String | Easy | 74.1% | 12.5% | String |
| Last Day Where You Can Still Cross | Hard | 68.6% | 12.5% | ArrayBinary SearchDepth-First Search+3 |
| Check Knight Tour Configuration | Medium | 60.5% | 12.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Minimum Pair Removal to Sort Array I | Easy | 65.3% | 12.5% | ArrayHash TableLinked List+4 |
| Maximum Unique Subarray Sum After Deletion | Easy | 40.5% | 12.5% | ArrayHash TableGreedy |
| Jump Game III | Medium | 66.7% | 12.5% | ArrayDepth-First SearchBreadth-First Search |
| Check Balanced String | Easy | 82.4% | 12.5% | String |
| Count Hills and Valleys in an Array | Easy | 69.1% | 12.5% | Array |
| Maximize Subarrays After Removing One Conflicting Pair | Hard | 64.7% | 12.5% | ArraySegment TreeEnumeration+1 |
| Longest Non-decreasing Subarray From Two Arrays | Medium | 31.0% | 12.5% | ArrayDynamic Programming |
| Maximum Number of Visible Points | Hard | 37.9% | 12.5% | ArrayMathGeometry+2 |
| A Number After a Double Reversal | Easy | 82.0% | 12.5% | Math |
| Minimize the Maximum Adjacent Element Difference | Hard | 19.3% | 12.5% | ArrayBinary SearchGreedy |
| Maximum Depth of N-ary Tree | Easy | 73.4% | 12.5% | TreeDepth-First SearchBreadth-First Search |
| Rearranging Fruits | Hard | 57.5% | 12.5% | ArrayHash TableGreedy+1 |
| Maximum Fruits Harvested After at Most K Steps | Hard | 61.0% | 12.5% | ArrayBinary SearchSliding Window+1 |
| Maximum Balanced Shipments | Medium | 61.3% | 12.5% | ArrayDynamic ProgrammingStack+2 |
| Inorder Successor in BST | Medium | 51.1% | 12.5% | |
| Maximum Size of a Set After Removals | Medium | 46.0% | 12.5% | ArrayHash TableGreedy |
| Fruits Into Baskets II | Easy | 70.2% | 12.5% | ArrayBinary SearchSegment Tree+2 |
| Patients With a Condition | Easy | 38.8% | 12.5% | Database |
| Fruits Into Baskets III | Medium | 38.9% | 12.5% | ArrayBinary SearchSegment Tree+1 |
| Maximum Difference by Remapping a Digit | Easy | 76.1% | 12.5% | MathGreedy |
| Range Product Queries of Powers | Medium | 61.4% | 12.5% | ArrayBit ManipulationPrefix Sum |
| Rectangle Area | Medium | 48.9% | 12.5% | MathGeometry |
| Ways to Express an Integer as Sum of Powers | Medium | 49.9% | 12.5% | Dynamic Programming |
| Analyze Organization Hierarchy | Hard | 59.3% | 12.5% | Database |
| Minimum Operations to Convert All Elements to Zero | Medium | 52.9% | 12.5% | ArrayHash TableStack+2 |
| Increasing Decreasing String | Easy | 77.2% | 12.5% | Hash TableStringCounting |
| Matchsticks to Square | Medium | 41.6% | 12.5% | ArrayDynamic ProgrammingBacktracking+2 |
| Find Valid Pair of Adjacent Digits in String | Easy | 60.6% | 12.5% | Hash TableStringCounting |
| Find Lucky Integer in an Array | Easy | 75.5% | 12.5% | ArrayHash TableCounting |
| Collecting Chocolates | Medium | 34.7% | 12.5% | ArrayEnumeration |
| Distinct Subsequences II | Hard | 44.0% | 12.5% | StringDynamic Programming |
| Count Submatrices With All Ones | Medium | 71.1% | 12.5% | ArrayDynamic ProgrammingStack+2 |
| Find the Minimum Area to Cover All Ones I | Medium | 78.2% | 12.5% | ArrayMatrix |
| Falling Squares | Hard | 47.3% | 12.5% | ArraySegment TreeOrdered Set |
| Rotating the Box | Medium | 79.2% | 12.5% | ArrayTwo PointersMatrix |
| Number of Ways to Form a Target String Given a Dictionary | Hard | 56.6% | 12.5% | ArrayStringDynamic Programming |
| Count Salary Categories | Medium | 64.0% | 12.5% | Database |
| Sort Matrix by Diagonals | Medium | 84.7% | 12.5% | ArraySortingMatrix |
| Remove Duplicates From an Unsorted Linked List | Medium | 75.7% | 12.5% | |
| Alice and Bob Playing Flower Game | Medium | 60.1% | 12.5% | Math |
| Balanced K-Factor Decomposition | Medium | 40.0% | 12.5% | MathBacktrackingNumber Theory |
| Minimum Time Visiting All Points | Easy | 84.8% | 12.5% | ArrayMathGeometry |
| Minimum Operations to Equalize Binary String | Hard | 20.3% | 12.5% | MathStringBreadth-First Search+2 |
| Remove Boxes | Hard | 49.3% | 12.5% | ArrayDynamic ProgrammingMemoization |
| Find the Number of Ways to Place People I | Medium | 64.0% | 12.5% | ArrayMathGeometry+2 |
| Maximum Number of Occurrences of a Substring | Medium | 54.2% | 12.5% | Hash TableStringSliding Window |
| Find Closest Person | Easy | 88.9% | 12.5% | Math |
| Find the Largest Palindrome Divisible by K | Hard | 16.9% | 12.5% | MathStringDynamic Programming+2 |
| Minimum Operations to Make the Integer Zero | Medium | 58.2% | 12.5% | Bit ManipulationBrainteaserEnumeration |
| Convert Integer to the Sum of Two No-Zero Integers | Easy | 59.1% | 12.5% | Math |
| Reshape Data: Melt | Easy | 86.0% | 12.5% | |
| Number of People Aware of a Secret | Medium | 60.9% | 12.5% | Dynamic ProgrammingQueueSimulation |
| Sort the Students by Their Kth Score | Medium | 86.0% | 12.5% | ArraySortingMatrix |
| Minimum Number of People to Teach | Medium | 67.7% | 12.5% | ArrayHash TableGreedy |
| Circular Sentence | Easy | 70.2% | 12.5% | String |
| Find Most Frequent Vowel and Consonant | Easy | 89.4% | 12.5% | Hash TableStringCounting |
| Vowel Spellchecker | Medium | 61.4% | 12.5% | ArrayHash TableString |
| Maximum Number of Words You Can Type | Easy | 82.9% | 12.5% | Hash TableString |
| Design Task Manager | Medium | 49.1% | 12.5% | Hash TableDesignHeap (Priority Queue)+1 |
| Unique Email Addresses | Easy | 67.8% | 12.5% | ArrayHash TableString |
| Ugly Number III | Medium | 31.2% | 12.5% | MathBinary SearchCombinatorics+1 |
| Maximum Number of Words Found in Sentences | Easy | 86.7% | 12.5% | ArrayString |
| Maximize Greatness of an Array | Medium | 61.2% | 12.5% | ArrayTwo PointersGreedy+1 |
| Alternating Digit Sum | Easy | 69.0% | 12.5% | Math |
| Find Target Indices After Sorting Array | Easy | 77.8% | 12.5% | ArrayBinary SearchSorting |
| Water Bottles II | Medium | 78.1% | 12.5% | MathSimulation |
| Count Substrings That Can Be Rearranged to Contain a String I | Medium | 42.6% | 12.5% | Hash TableStringSliding Window |
| Sort Items by Groups Respecting Dependencies | Hard | 65.6% | 12.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Minimum Number of Chairs in a Waiting Room | Easy | 79.2% | 12.5% | StringSimulation |
| Minimum Operations to Write the Letter Y on a Grid | Medium | 64.3% | 12.5% | ArrayHash TableMatrix+1 |
| Friends Of Appropriate Ages | Medium | 49.8% | 12.5% | ArrayTwo PointersBinary Search+1 |
| Count Number of Ways to Place Houses | Medium | 43.8% | 12.5% | Dynamic Programming |
| Binary Tree Coloring Game | Medium | 52.8% | 12.5% | TreeDepth-First SearchBinary Tree |
| Find the Minimum Amount of Time to Brew Potions | Medium | 62.7% | 12.5% | ArraySimulationPrefix Sum |
| Taking Maximum Energy From the Mystic Dungeon | Medium | 61.0% | 12.5% | ArrayPrefix Sum |
| Maximum Total Damage With Spell Casting | Medium | 45.0% | 12.5% | ArrayHash TableTwo Pointers+4 |
| Two-Letter Card Game | Medium | 12.2% | 12.5% | ArrayHash TableString+2 |
| Sequence Reconstruction | Medium | 30.5% | 12.5% | |
| Maximum Value after Insertion | Medium | 39.2% | 12.5% | StringGreedy |
| Smallest Missing Non-negative Integer After Operations | Medium | 55.9% | 12.5% | ArrayHash TableMath+1 |
| Delete Duplicate Folders in System | Hard | 77.7% | 12.5% | ArrayHash TableString+2 |
| Maximum Number of Distinct Elements After Operations | Medium | 52.2% | 12.5% | ArrayGreedySorting |
| Reshape Data: Concatenate | Easy | 90.5% | 12.5% | |
| Lexicographically Smallest Permutation Greater Than Target | Medium | 26.5% | 12.5% | Hash TableStringGreedy+2 |
| Sum of Digits in Base K | Easy | 78.5% | 12.5% | Math |
| Longest Subsequence With Limited Sum | Easy | 73.4% | 12.5% | ArrayBinary SearchGreedy+2 |
| Maximum Frequency of an Element After Performing Operations II | Hard | 53.9% | 12.5% | ArrayBinary SearchSliding Window+2 |
| Maximum Frequency of an Element After Performing Operations I | Medium | 40.1% | 12.5% | ArrayBinary SearchSliding Window+2 |
| Sum of Perfect Square Ancestors | Hard | 42.4% | 12.5% | ArrayHash TableMath+4 |
| Consecutive Characters | Easy | 60.3% | 12.5% | String |
| Non-decreasing Subsequences | Medium | 62.5% | 12.5% | ArrayHash TableBacktracking+1 |
| Make Array Elements Equal to Zero | Easy | 68.3% | 12.5% | ArraySimulationPrefix Sum |
| Stable Subarrays With Equal Boundary and Interior Sum | Medium | 25.9% | 12.5% | ArrayHash TablePrefix Sum |
| Smallest Number With All Set Bits | Easy | 80.3% | 12.5% | MathBit Manipulation |
| Number of Good Paths | Hard | 56.3% | 12.5% | ArrayHash TableTree+3 |
| The Two Sneaky Numbers of Digitville | Easy | 89.9% | 12.5% | ArrayHash TableMath |
| Maximum and Minimum Sums of at Most Size K Subsequences | Medium | 21.6% | 12.5% | ArrayMathDynamic Programming+2 |
| Count Unguarded Cells in the Grid | Medium | 69.0% | 12.5% | ArrayMatrixSimulation |
| Minimum Time to Make Rope Colorful | Medium | 65.2% | 12.5% | ArrayStringDynamic Programming+1 |
| Find X-Sum of All K-Long Subarrays I | Easy | 76.1% | 12.5% | ArrayHash TableSliding Window+1 |
| Smallest Palindromic Rearrangement I | Medium | 63.5% | 12.5% | StringSortingCounting Sort |
| Best Time to Buy and Sell Stock V | Medium | 60.8% | 12.5% | ArrayDynamic Programming |
| Power Grid Maintenance | Medium | 56.3% | 12.5% | ArrayHash TableDepth-First Search+5 |
| Maximize the Minimum Powered City | Hard | 61.8% | 12.5% | ArrayBinary SearchGreedy+3 |
| Wiggle Sort | Medium | 68.4% | 12.5% | |
| Count Operations to Obtain Zero | Easy | 79.8% | 12.5% | MathSimulation |
| Minimum Number of Operations to Make All Array Elements Equal to 1 | Medium | 54.6% | 12.5% | ArrayMathNumber Theory |
| Maximum Number of Operations to Move Ones to the End | Medium | 67.1% | 12.5% | StringGreedyCounting |
| Minimum Unique Word Abbreviation | Hard | 40.4% | 12.5% | |
| Minimum Number of Groups to Create a Valid Assignment | Medium | 24.8% | 12.5% | ArrayHash TableGreedy |
| Minimum Number of Vertices to Reach All Nodes | Medium | 81.5% | 12.5% | Graph Theory |
| Strange Printer II | Hard | 60.6% | 12.5% | ArrayGraph TheoryTopological Sort+1 |
| Set Intersection Size At Least Two | Hard | 57.9% | 12.5% | ArrayGreedySorting |
| Find Minimum Operations to Make All Elements Divisible by Three | Easy | 90.9% | 12.5% | ArrayMath |
| Minimum Time for K Connected Components | Medium | 45.1% | 12.5% | Binary SearchUnion-FindGraph Theory+1 |
| Smallest Integer Divisible by K | Medium | 54.3% | 12.5% | Hash TableMath |
| Paths in Matrix Whose Sum Is Divisible by K | Hard | 58.7% | 12.5% | ArrayDynamic ProgrammingMatrix |
| Car Fleet II | Hard | 57.7% | 12.5% | ArrayMathStack+2 |
| Maximum Subarray Sum With Length Divisible by K | Medium | 49.6% | 12.5% | ArrayHash TablePrefix Sum |
| Truncate Sentence | Easy | 86.6% | 12.5% | ArrayString |
| Maximum Running Time of N Computers | Hard | 56.4% | 12.5% | ArrayBinary SearchGreedy+1 |
| Longest Substring Of All Vowels in Order | Medium | 51.5% | 12.5% | StringSliding Window |
| License Key Formatting | Easy | 45.7% | 12.5% | String |
| Minimum Operations to Make Array Equal | Medium | 82.7% | 12.5% | Math |
| Count Partitions with Even Sum Difference | Easy | 85.2% | 12.5% | ArrayMathPrefix Sum |
| Count Partitions With Max-Min Difference at Most K | Medium | 58.9% | 12.5% | ArrayDynamic ProgrammingQueue+3 |
| Clumsy Factorial | Medium | 61.0% | 12.5% | MathStackSimulation |
| Shortest Distance After Road Addition Queries I | Medium | 61.9% | 12.5% | ArrayBreadth-First SearchGraph Theory |
| Sign of the Product of an Array | Easy | 64.8% | 12.5% | ArrayMath |
| Minimum Operations to Make Array Sum Divisible by K | Easy | 92.4% | 12.5% | ArrayMath |
| Count the Digits That Divide a Number | Easy | 85.9% | 12.5% | Math |
| Count the Number of Computer Unlocking Permutations | Medium | 59.0% | 12.5% | ArrayMathBrainteaser+1 |
| Find the Array Concatenation Value | Easy | 71.8% | 12.5% | ArrayTwo PointersSimulation |
| Binary Prefix Divisible By 5 | Easy | 53.5% | 12.5% | ArrayBit Manipulation |
| Operations on Tree | Medium | 45.0% | 12.5% | ArrayHash TableTree+3 |
| Count Largest Group | Easy | 74.7% | 12.5% | Hash TableMathCounting |
| Maximize Cyclic Partition Score | Hard | 12.3% | 12.5% | ArrayDynamic Programming |
| Implement Router | Medium | 39.2% | 12.5% | ArrayHash TableBinary Search+3 |
| Best Time to Buy and Sell Stock using Strategy | Medium | 59.9% | 12.5% | ArraySliding WindowPrefix Sum |
| Construct Product Matrix | Medium | 32.0% | 12.5% | ArrayMatrixPrefix Sum |
| Delete Columns to Make Sorted II | Medium | 49.7% | 12.5% | ArrayStringGreedy |
| Find the Power of K-Size Subarrays I | Medium | 62.2% | 12.5% | ArraySliding Window |
| Number of Ways to Separate Numbers | Hard | 21.6% | 12.5% | StringDynamic ProgrammingSuffix Array |
| Range Addition II | Easy | 58.3% | 12.5% | ArrayMath |
| Paint House | Medium | 64.3% | 12.5% | |
| Minimum Penalty for a Shop | Medium | 71.2% | 12.5% | StringPrefix Sum |
| Partition Array Into Three Parts With Equal Sum | Easy | 42.5% | 12.5% | ArrayGreedy |
| Ones and Zeroes | Medium | 53.0% | 12.5% | ArrayStringDynamic Programming |
| Delete Columns to Make Sorted III | Hard | 72.6% | 12.5% | ArrayStringDynamic Programming |
| Maximum Score of a Good Subarray | Hard | 64.4% | 12.5% | ArrayTwo PointersBinary Search+2 |
| Pyramid Transition Matrix | Medium | 60.6% | 12.5% | Hash TableStringBacktracking+1 |
| Minimum Reverse Operations | Hard | 16.6% | 12.5% | ArrayHash TableBreadth-First Search+2 |
| N-Repeated Element in Size 2N Array | Easy | 79.8% | 12.5% | ArrayHash Table |
| Number of Ways to Paint N × 3 Grid | Hard | 80.5% | 12.5% | Dynamic Programming |
| Four Divisors | Medium | 56.6% | 12.5% | ArrayMath |
| Lucky Numbers in a Matrix | Easy | 80.0% | 12.5% | ArrayMatrix |
| Sparse Matrix Multiplication | Medium | 69.2% | 12.5% | |
| Second Minimum Node In a Binary Tree | Easy | 45.9% | 12.5% | TreeDepth-First SearchBinary Tree |
| Smallest Subtree with all the Deepest Nodes | Medium | 77.5% | 12.5% | Hash TableTreeDepth-First Search+2 |
| Find Followers Count | Easy | 69.5% | 12.5% | Database |
| Shuffle String | Easy | 85.3% | 12.5% | ArrayString |
| Perfect Rectangle | Hard | 37.2% | 12.5% | ArrayHash TableMath+2 |
| Restore the Array From Adjacent Pairs | Medium | 75.0% | 12.5% | ArrayHash TableDepth-First Search |
| Maximize Area of Square Hole in Grid | Medium | 61.9% | 12.5% | ArraySorting |
| Find Original Array From Doubled Array | Medium | 40.7% | 12.5% | ArrayHash TableGreedy+1 |
| Number of Substrings With Only 1s | Medium | 57.4% | 12.5% | MathString |
| Smallest Good Base | Hard | 45.4% | 12.5% | MathBinary Search |
| Construct the Minimum Bitwise Array I | Easy | 85.3% | 12.5% | ArrayBit Manipulation |
| Construct the Minimum Bitwise Array II | Medium | 66.5% | 12.5% | ArrayBit Manipulation |
| Split Array With Same Average | Hard | 26.8% | 12.5% | ArrayHash TableMath+3 |
| Promise Time Limit | Medium | 83.1% | 12.5% | |
| Minimum Pair Removal to Sort Array II | Hard | 39.2% | 12.5% | ArrayHash TableLinked List+4 |
| Maximum Sum of Three Numbers Divisible by Three | Medium | 47.7% | 12.5% | ArrayGreedySorting+1 |
| Minimize Maximum Pair Sum in Array | Medium | 83.3% | 12.5% | ArrayTwo PointersGreedy+1 |
| Non-decreasing Array | Medium | 25.4% | 12.5% | Array |
| Implement Trie II (Prefix Tree) | Medium | 63.3% | 12.5% | |
| Minimum Cost Path with Edge Reversals | Medium | 61.8% | 12.5% | Graph TheoryHeap (Priority Queue)Shortest Path |
| Minimum Cost Path with Teleportations | Hard | 45.8% | 12.5% | ArrayDynamic ProgrammingMatrix |
| Minimize the Maximum of Two Arrays | Medium | 32.1% | 12.5% | MathBinary SearchNumber Theory |
| Minimum Value to Get Positive Step by Step Sum | Easy | 64.6% | 12.5% | ArrayPrefix Sum |
| Count Symmetric Integers | Easy | 83.1% | 12.5% | MathEnumeration |
| Frog Jump II | Medium | 62.4% | 12.5% | ArrayBinary SearchGreedy |
| Divide an Array Into Subarrays With Minimum Cost II | Hard | 54.8% | 12.5% | ArrayHash TableSliding Window+1 |
| Design Spreadsheet | Medium | 74.3% | 12.5% | ArrayHash TableString+2 |
| Array Nesting | Medium | 56.5% | 12.5% | ArrayDepth-First Search |
| Non-negative Integers without Consecutive Ones | Hard | 41.7% | 12.5% | Dynamic Programming |
| Transformed Array | Easy | 70.4% | 12.5% | ArraySimulation |
| Max Sum of Rectangle No Larger Than K | Hard | 45.3% | 12.5% | ArrayBinary SearchMatrix+2 |
| Knight Probability in Chessboard | Medium | 56.9% | 12.5% | Dynamic Programming |
| 3Sum With Multiplicity | Medium | 46.2% | 12.5% | ArrayHash TableTwo Pointers+2 |
| Find Greatest Common Divisor of Array | Easy | 79.7% | 12.5% | ArrayMathNumber Theory |
| Vowels Game in a String | Medium | 77.1% | 12.5% | MathStringBrainteaser+1 |
| Reachable Nodes In Subdivided Graph | Hard | 51.8% | 12.5% | Graph TheoryHeap (Priority Queue)Shortest Path |
| Largest Magic Square | Medium | 75.3% | 12.5% | ArrayMatrixPrefix Sum |
| Minimum Addition to Make Integer Beautiful | Medium | 38.5% | 12.5% | MathGreedy |
| Minimum Hours of Training to Win a Competition | Easy | 42.4% | 12.5% | ArrayGreedy |
| Ant on the Boundary | Easy | 74.2% | 12.5% | ArraySimulationPrefix Sum |
| Maximum Number of Points From Grid Queries | Hard | 59.3% | 12.5% | ArrayTwo PointersBreadth-First Search+4 |
| Longest Balanced Subarray I | Medium | 65.6% | 12.5% | ArrayHash TableDivide and Conquer+2 |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 57.2% | 12.5% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+1 |
| Minimum Absolute Difference in BST | Easy | 59.2% | 12.5% | TreeDepth-First SearchBreadth-First Search+2 |
| Find the Number of Good Pairs I | Easy | 86.3% | 12.5% | ArrayHash Table |
| Longest Balanced Subarray II | Hard | 33.8% | 12.5% | ArrayHash TableDivide and Conquer+2 |
| Longest Balanced Substring I | Medium | 69.7% | 12.5% | Hash TableStringCounting+1 |
| Longest Balanced Substring II | Medium | 42.1% | 12.5% | Hash TableStringPrefix Sum |
| Maximum Length Substring With Two Occurrences | Easy | 65.1% | 12.5% | Hash TableStringSliding Window |
| Find the Distance Value Between Two Arrays | Easy | 71.4% | 12.5% | ArrayTwo PointersBinary Search+1 |
| Find Maximum Value in a Constrained Sequence | Medium | 62.3% | 12.5% | ArrayGreedy |
| Champagne Tower | Medium | 64.0% | 12.5% | Dynamic Programming |
| Unique Morse Code Words | Easy | 83.5% | 12.5% | ArrayHash TableString |
| Longest Univalue Path | Medium | 43.5% | 12.5% | TreeDepth-First SearchBinary Tree |
| Minimum Seconds to Equalize a Circular Array | Medium | 28.4% | 12.5% | ArrayHash Table |
| Happy Students | Medium | 50.8% | 12.5% | ArraySortingEnumeration |
| Binary Number with Alternating Bits | Easy | 69.7% | 12.5% | Bit Manipulation |
| Smallest String Starting From Leaf | Medium | 61.1% | 12.5% | StringBacktrackingTree+2 |
| Customer Placing the Largest Number of Orders | Easy | 64.3% | 12.5% | Database |
| Memoize | Medium | 64.8% | 12.5% | |