| Binary Tree Cameras | Hard | 47.6% | 100.0% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Find Minimum Cost to Remove Array Elements | Medium | 21.3% | 87.5% | ArrayDynamic Programming |
| Letter Combinations of a Phone Number | Medium | 65.5% | 75.0% | Hash TableStringBacktracking |
| Maximum Points After Collecting Coins From All Nodes | Hard | 36.3% | 75.0% | ArrayDynamic ProgrammingBit Manipulation+3 |
| Relative Sort Array | Easy | 75.1% | 75.0% | ArrayHash TableSorting+1 |
| Maximum Strength of K Disjoint Subarrays | Hard | 27.5% | 75.0% | ArrayDynamic ProgrammingPrefix Sum |
| Removing Minimum Number of Magic Beans | Medium | 44.4% | 75.0% | ArrayGreedySorting+2 |
| Find the Sum of the Power of All Subsequences | Hard | 38.0% | 75.0% | ArrayDynamic Programming |
| Minimum Cost Walk in Weighted Graph | Hard | 68.3% | 75.0% | ArrayBit ManipulationUnion-Find+1 |
| Minimum Deletions to Make String K-Special | Medium | 67.2% | 75.0% | Hash TableStringGreedy+2 |
| Greatest Sum Divisible by Three | Medium | 57.1% | 75.0% | ArrayDynamic ProgrammingGreedy+1 |
| Query Kth Smallest Trimmed Number | Medium | 47.1% | 75.0% | ArrayStringDivide and Conquer+4 |
| Equal Row and Column Pairs | Medium | 70.8% | 75.0% | ArrayHash TableMatrix+1 |
| Number of Subarrays With AND Value of K | Hard | 35.0% | 75.0% | ArrayBinary SearchBit Manipulation+1 |
| Minimum Number of Taps to Open to Water a Garden | Hard | 51.0% | 75.0% | ArrayDynamic ProgrammingGreedy |
| Number of Substrings Containing All Three Characters | Medium | 73.5% | 75.0% | Hash TableStringSliding Window |
| Minimum Size Subarray in Infinite Array | Medium | 31.9% | 75.0% | ArrayHash TableSliding Window+1 |
| Maximum Deletions on a String | Hard | 35.7% | 75.0% | StringDynamic ProgrammingRolling Hash+2 |
| Median of a Row Wise Sorted Matrix | Medium | 70.8% | 75.0% | |
| Maximum Subsequence Score | Medium | 54.6% | 75.0% | ArrayGreedySorting+1 |
| Determine the Winner of a Bowling Game | Easy | 37.1% | 75.0% | ArraySimulation |
| Take Gifts From the Richest Pile | Easy | 75.5% | 75.0% | ArrayHeap (Priority Queue)Simulation |
| Find the Maximum Divisibility Score | Easy | 51.6% | 75.0% | Array |
| Max Number of K-Sum Pairs | Medium | 56.9% | 75.0% | ArrayHash TableTwo Pointers+1 |
| Shortest String That Contains Three Strings | Medium | 31.5% | 75.0% | StringGreedyEnumeration |
| Sum Game | Medium | 49.5% | 75.0% | MathStringGreedy+1 |
| Count the Number of Incremovable Subarrays II | Hard | 40.1% | 75.0% | ArrayTwo PointersBinary Search |
| Find Peak Calling Hours for Each City | Medium | 61.3% | 75.0% | |
| Minimize Connected Groups by Inserting Interval | Medium | 50.3% | 75.0% | |
| Maximum Points Tourist Can Earn | Medium | 47.4% | 75.0% | ArrayDynamic ProgrammingMatrix |
| Minimum Runes to Add to Cast Spell | Hard | 44.6% | 75.0% | |
| Maximum Number of Subsequences After One Inserting | Medium | 31.7% | 75.0% | StringDynamic ProgrammingGreedy+1 |
| Trapping Rain Water | Hard | 66.8% | 62.5% | ArrayTwo PointersDynamic Programming+2 |
| Sliding Window Maximum | Hard | 48.4% | 62.5% | ArrayQueueSliding Window+2 |
| K-th Smallest in Lexicographical Order | Hard | 46.2% | 62.5% | Trie |
| Painting the Walls | Hard | 48.9% | 62.5% | ArrayDynamic Programming |
| Valid Parentheses | Easy | 43.7% | 62.5% | StringStack |
| Majority Element | Easy | 66.1% | 62.5% | ArrayHash TableDivide and Conquer+2 |
| Minimum Number of Refueling Stops | Hard | 41.1% | 62.5% | ArrayDynamic ProgrammingGreedy+1 |
| Using a Robot to Print the Lexicographically Smallest String | Medium | 62.5% | 62.5% | Hash TableStringStack+1 |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 50.0% | ArrayDynamic Programming |
| Longest Consecutive Sequence | Medium | 47.0% | 50.0% | ArrayHash TableUnion-Find |
| Maximum Product Subarray | Medium | 36.0% | 50.0% | ArrayDynamic Programming |
| House Robber | Medium | 52.9% | 50.0% | ArrayDynamic Programming |
| Basic Calculator II | Medium | 46.6% | 50.0% | MathStringStack |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 50.0% | ArrayHash TableMath+2 |
| Maximum Performance of a Team | Hard | 47.7% | 50.0% | ArrayGreedySorting+1 |
| Put Marbles in Bags | Hard | 72.2% | 50.0% | ArrayGreedySorting+1 |
| Furthest Building You Can Reach | Medium | 50.7% | 50.0% | ArrayGreedyHeap (Priority Queue) |
| Average Waiting Time | Medium | 73.1% | 50.0% | ArraySimulation |
| Swim in Rising Water | Hard | 67.6% | 50.0% | ArrayBinary SearchDepth-First Search+4 |
| Open the Lock | Medium | 61.1% | 50.0% | ArrayHash TableString+1 |
| Best Time to Buy and Sell Stock II | Medium | 70.7% | 50.0% | ArrayDynamic ProgrammingGreedy |
| Minimum Number of Pushes to Type Word II | Medium | 80.0% | 50.0% | Hash TableStringGreedy+2 |
| Koko Eating Bananas | Medium | 49.7% | 50.0% | ArrayBinary Search |
| 4Sum | Medium | 40.0% | 50.0% | ArrayTwo PointersSorting |
| Find the Smallest Divisor Given a Threshold | Medium | 65.4% | 50.0% | ArrayBinary Search |
| Heaters | Medium | 41.4% | 50.0% | ArrayTwo PointersBinary Search+1 |
| Shortest Subarray to be Removed to Make Array Sorted | Medium | 51.3% | 50.0% | ArrayTwo PointersBinary Search+2 |
| Kth Smallest Number in Multiplication Table | Hard | 53.8% | 50.0% | MathBinary Search |
| Split Array Largest Sum | Hard | 59.8% | 50.0% | ArrayBinary SearchDynamic Programming+2 |
| Consecutive Numbers Sum | Hard | 42.6% | 50.0% | MathEnumeration |
| Coin Change II | Medium | 60.5% | 50.0% | ArrayDynamic Programming |
| Implement Rand10() Using Rand7() | Medium | 46.2% | 50.0% | MathRejection SamplingRandomized+1 |
| Excel Sheet Column Title | Easy | 45.7% | 50.0% | MathString |
| Longest String Chain | Medium | 62.8% | 50.0% | ArrayHash TableTwo Pointers+3 |
| Maximize Score of Numbers in Ranges | Medium | 35.5% | 50.0% | ArrayBinary SearchGreedy+1 |
| Sum of Subarray Ranges | Medium | 60.7% | 50.0% | ArrayStackMonotonic Stack |
| Find Triangular Sum of an Array | Medium | 82.0% | 50.0% | ArrayMathSimulation+2 |
| Rotting Oranges | Medium | 58.1% | 50.0% | ArrayBreadth-First SearchMatrix |
| Minimum Cost to Merge Stones | Hard | 45.6% | 50.0% | ArrayDynamic ProgrammingPrefix Sum |
| Median of Two Sorted Arrays | Hard | 45.9% | 37.5% | ArrayBinary SearchDivide and Conquer |
| Generate Parentheses | Medium | 78.2% | 37.5% | StringDynamic ProgrammingBacktracking |
| Maximum Subarray | Medium | 53.0% | 37.5% | ArrayDivide and ConquerDynamic Programming |
| Unique Paths | Medium | 66.5% | 37.5% | MathDynamic ProgrammingCombinatorics |
| Largest Rectangle in Histogram | Hard | 49.3% | 37.5% | ArrayStackMonotonic Stack |
| Maximal Rectangle | Hard | 58.1% | 37.5% | ArrayDynamic ProgrammingStack+2 |
| Maximal Square | Medium | 50.0% | 37.5% | ArrayDynamic ProgrammingMatrix |
| Max Sum of Rectangle No Larger Than K | Hard | 45.3% | 37.5% | ArrayBinary SearchMatrix+2 |
| Task Scheduler | Medium | 62.6% | 37.5% | ArrayHash TableGreedy+3 |
| Peak Index in a Mountain Array | Medium | 66.9% | 37.5% | ArrayBinary Search |
| Cheapest Flights Within K Stops | Medium | 41.4% | 37.5% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+3 |
| Combination Sum | Medium | 76.1% | 37.5% | ArrayBacktracking |
| Number of Ways to Reorder Array to Get Same BST | Hard | 54.0% | 37.5% | ArrayMathDivide and Conquer+7 |
| Minimum Number of Visited Cells in a Grid | Hard | 23.6% | 37.5% | ArrayDynamic ProgrammingStack+5 |
| Maximum OR | Medium | 42.6% | 37.5% | ArrayGreedyBit Manipulation+1 |
| Minimum Size Subarray Sum | Medium | 51.0% | 37.5% | ArrayBinary SearchSliding Window+1 |
| Maximum Points You Can Obtain from Cards | Medium | 57.2% | 37.5% | ArraySliding WindowPrefix Sum |
| Find the Shortest Superstring | Hard | 45.1% | 37.5% | ArrayStringDynamic Programming+2 |
| Find First and Last Position of Element in Sorted Array | Medium | 48.3% | 37.5% | ArrayBinary Search |
| Linked List Cycle | Easy | 53.9% | 37.5% | Hash TableLinked ListTwo Pointers |
| Remove Max Number of Edges to Keep Graph Fully Traversable | Hard | 70.2% | 37.5% | Union-FindGraph Theory |
| K-th Symbol in Grammar | Medium | 48.1% | 37.5% | MathBit ManipulationRecursion |
| Flatten Nested List Iterator | Medium | 65.6% | 37.5% | StackTreeDepth-First Search+3 |
| Knight Dialer | Medium | 61.7% | 37.5% | Dynamic Programming |
| Maximum Number of Points with Cost | Medium | 41.8% | 37.5% | ArrayDynamic ProgrammingMatrix |
| Find the Duplicate Number | Medium | 64.0% | 37.5% | ArrayTwo PointersBinary Search+1 |
| Asteroid Collision | Medium | 47.1% | 37.5% | ArrayStackSimulation |
| Design A Leaderboard | Medium | 68.1% | 37.5% | |
| Decode Ways | Medium | 37.6% | 37.5% | StringDynamic Programming |
| Text Justification | Hard | 50.4% | 37.5% | ArrayStringSimulation |
| Number of Ways to Wear Different Hats to Each Other | Hard | 45.7% | 37.5% | ArrayDynamic ProgrammingBit Manipulation+1 |
| Validate Binary Search Tree | Medium | 35.3% | 37.5% | TreeDepth-First SearchBinary Search Tree+1 |
| Candy | Hard | 47.9% | 37.5% | ArrayGreedy |
| Number of Islands | Medium | 63.8% | 37.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Word Search II | Hard | 38.1% | 37.5% | ArrayStringBacktracking+2 |
| Longest Valid Parentheses | Hard | 38.0% | 37.5% | StringDynamic ProgrammingStack |
| Best Time to Buy and Sell Stock IV | Hard | 49.5% | 37.5% | ArrayDynamic Programming |
| LRU Cache | Medium | 46.8% | 37.5% | Hash TableLinked ListDesign+1 |
| Maximum Side Length of a Square with Sum Less than or Equal to Threshold | Medium | 65.5% | 37.5% | ArrayBinary SearchMatrix+1 |
| Wildcard Matching | Hard | 31.3% | 37.5% | StringDynamic ProgrammingGreedy+1 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 37.5% | Hash TableStringSliding Window |
| Copy List with Random Pointer | Medium | 62.4% | 37.5% | Hash TableLinked List |
| Reorganize String | Medium | 56.8% | 37.5% | Hash TableStringGreedy+3 |
| Minimum Cost to Make at Least One Valid Path in a Grid | Hard | 70.9% | 37.5% | ArrayBreadth-First SearchGraph Theory+3 |
| Number of Ways to Select Buildings | Medium | 50.8% | 37.5% | StringDynamic ProgrammingPrefix Sum |
| Maximum Width Ramp | Medium | 55.8% | 37.5% | ArrayTwo PointersStack+1 |
| Loud and Rich | Medium | 63.2% | 37.5% | ArrayDepth-First SearchGraph Theory+1 |
| Count Binary Substrings | Easy | 70.2% | 37.5% | Two PointersString |
| Two Sum | Easy | 57.1% | 37.5% | ArrayHash Table |
| Merge Sorted Array | Easy | 54.4% | 37.5% | ArrayTwo PointersSorting |
| Remove Duplicate Letters | Medium | 52.8% | 37.5% | StringStackGreedy+1 |
| Next Permutation | Medium | 44.7% | 37.5% | ArrayTwo Pointers |
| House Robber II | Medium | 44.6% | 37.5% | ArrayDynamic Programming |