| Sliding Window Maximum | Hard | 48.4% | 100.0% | ArrayQueueSliding Window+2 |
| Palindromic Substrings | Medium | 72.5% | 100.0% | Two PointersStringDynamic Programming |
| Count Palindromic Subsequences | Hard | 41.0% | 100.0% | StringDynamic Programming |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 87.5% | ArrayDynamic Programming |
| Find Median from Data Stream | Hard | 54.2% | 87.5% | Two PointersDesignSorting+2 |
| Maximum Total Damage With Spell Casting | Medium | 45.0% | 87.5% | ArrayHash TableTwo Pointers+4 |
| Minimum Costs Using the Train Line | Hard | 77.9% | 87.5% | |
| Best Position for a Service Centre | Hard | 35.2% | 87.5% | ArrayMathGeometry+1 |
| First Completely Painted Row or Column | Medium | 63.9% | 87.5% | ArrayHash TableMatrix |
| Minimum Operations to Make Numbers Non-positive | Hard | 44.0% | 87.5% | |
| Maximum Length of Repeated Subarray | Medium | 51.2% | 87.5% | ArrayBinary SearchDynamic Programming+3 |
| Merge Intervals | Medium | 51.1% | 87.5% | ArraySorting |
| Minimum Equal Sum of Two Arrays After Replacing Zeros | Medium | 50.2% | 75.0% | ArrayGreedy |
| Longest String Chain | Medium | 62.8% | 75.0% | ArrayHash TableTwo Pointers+3 |
| LRU Cache | Medium | 46.8% | 75.0% | Hash TableLinked ListDesign+1 |
| Evaluate Reverse Polish Notation | Medium | 57.0% | 75.0% | ArrayMathStack |
| Find the Duplicate Number | Medium | 64.0% | 75.0% | ArrayTwo PointersBinary Search+1 |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 75.0% | ArrayHash TableMath+2 |
| Evaluate Division | Medium | 64.0% | 75.0% | ArrayStringDepth-First Search+4 |
| LFU Cache | Hard | 48.6% | 75.0% | Hash TableLinked ListDesign+1 |
| Length of Longest Subarray With at Most K Frequency | Medium | 56.4% | 75.0% | ArrayHash TableSliding Window |
| Parallel Courses III | Hard | 66.8% | 75.0% | ArrayDynamic ProgrammingGraph Theory+1 |
| Employee Free Time | Hard | 72.8% | 75.0% | |
| Meeting Scheduler | Medium | 55.2% | 75.0% | |
| Number of Orders in the Backlog | Medium | 53.6% | 75.0% | ArrayHeap (Priority Queue)Simulation |
| Minimum Knight Moves | Medium | 41.7% | 62.5% | |
| Number of Islands | Medium | 63.8% | 62.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Serialize and Deserialize Binary Tree | Hard | 60.3% | 62.5% | StringTreeDepth-First Search+3 |
| Search Suggestions System | Medium | 65.2% | 62.5% | ArrayStringBinary Search+3 |
| Group Anagrams | Medium | 72.2% | 62.5% | ArrayHash TableString+1 |
| Design Circular Queue | Medium | 54.0% | 62.5% | ArrayLinked ListDesign+1 |
| Fizz Buzz | Easy | 75.2% | 62.5% | MathStringSimulation |
| Couples Holding Hands | Hard | 59.2% | 62.5% | GreedyDepth-First SearchBreadth-First Search+2 |
| Course Schedule II | Medium | 55.0% | 62.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Moving Average from Data Stream | Easy | 80.2% | 62.5% | |
| Sqrt(x) | Easy | 41.4% | 62.5% | MathBinary Search |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.1% | 62.5% | TreeBreadth-First SearchBinary Tree |
| Find Servers That Handled Most Number of Requests | Hard | 45.2% | 62.5% | ArrayHeap (Priority Queue)Simulation+1 |
| Reconstruct Itinerary | Hard | 44.3% | 62.5% | ArrayStringDepth-First Search+4 |
| Max Consecutive Ones III | Medium | 67.3% | 62.5% | ArrayBinary SearchSliding Window+1 |
| Smallest Missing Non-negative Integer After Operations | Medium | 55.9% | 62.5% | ArrayHash TableMath+1 |
| Regular Expression Matching | Hard | 30.4% | 50.0% | StringDynamic ProgrammingRecursion |
| Merge k Sorted Lists | Hard | 58.8% | 50.0% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Sudoku Solver | Hard | 65.4% | 50.0% | ArrayHash TableBacktracking+1 |
| Combination Sum | Medium | 76.1% | 50.0% | ArrayBacktracking |
| Trapping Rain Water | Hard | 66.8% | 50.0% | ArrayTwo PointersDynamic Programming+2 |
| Permutations | Medium | 81.6% | 50.0% | ArrayBacktracking |
| Simplify Path | Medium | 50.0% | 50.0% | StringStack |
| Best Time to Buy and Sell Stock III | Hard | 53.1% | 50.0% | ArrayDynamic Programming |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 50.0% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Course Schedule | Medium | 50.8% | 50.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Maximal Square | Medium | 50.0% | 50.0% | ArrayDynamic ProgrammingMatrix |
| Perfect Squares | Medium | 56.3% | 50.0% | MathDynamic ProgrammingBreadth-First Search |
| Design Search Autocomplete System | Hard | 49.7% | 50.0% | |
| Delete and Earn | Medium | 57.1% | 50.0% | ArrayHash TableDynamic Programming |
| Longest Non-decreasing Subarray From Two Arrays | Medium | 31.0% | 50.0% | ArrayDynamic Programming |
| Word Search | Medium | 46.8% | 50.0% | ArrayStringBacktracking+2 |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 50.0% | Hash TableStringDesign+1 |
| Design Excel Sum Formula | Hard | 39.8% | 50.0% | |
| Egg Drop With 2 Eggs and N Floors | Medium | 74.6% | 50.0% | MathDynamic Programming |
| Design Front Middle Back Queue | Medium | 56.9% | 50.0% | ArrayLinked ListDesign+3 |
| Reorganize String | Medium | 56.8% | 50.0% | Hash TableStringGreedy+3 |
| Sort Items by Groups Respecting Dependencies | Hard | 65.6% | 50.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Count Number of Maximum Bitwise-OR Subsets | Medium | 89.6% | 50.0% | ArrayBacktrackingBit Manipulation+1 |
| Word Ladder II | Hard | 27.5% | 50.0% | Hash TableStringBacktracking+1 |
| Letter Combinations of a Phone Number | Medium | 65.5% | 50.0% | Hash TableStringBacktracking |
| Climbing Stairs | Easy | 53.9% | 50.0% | MathDynamic ProgrammingMemoization |
| Paint House | Medium | 64.3% | 50.0% | |
| Rank Transform of a Matrix | Hard | 42.0% | 50.0% | ArrayUnion-FindGraph Theory+3 |
| Longest Increasing Subsequence | Medium | 59.0% | 50.0% | ArrayBinary SearchDynamic Programming |
| Pow(x, n) | Medium | 38.2% | 50.0% | MathRecursion |
| Integer to Roman | Medium | 70.4% | 50.0% | Hash TableMathString |
| Koko Eating Bananas | Medium | 49.7% | 50.0% | ArrayBinary Search |
| Max Points on a Line | Hard | 30.2% | 50.0% | ArrayHash TableMath+1 |
| Longest Palindromic Substring | Medium | 37.3% | 50.0% | Two PointersStringDynamic Programming |
| Pairs of Songs With Total Durations Divisible by 60 | Medium | 53.4% | 50.0% | ArrayHash TableCounting |
| Count Primes | Medium | 35.7% | 50.0% | ArrayMathEnumeration+1 |
| Meeting Rooms II | Medium | 52.5% | 50.0% | |
| Find First and Last Position of Element in Sorted Array | Medium | 48.3% | 50.0% | ArrayBinary Search |
| Next Permutation | Medium | 44.7% | 50.0% | ArrayTwo Pointers |
| Validate Binary Search Tree | Medium | 35.3% | 50.0% | TreeDepth-First SearchBinary Search Tree+1 |
| Integer Break | Medium | 61.8% | 50.0% | MathDynamic Programming |
| Reverse Words in a String | Medium | 55.5% | 50.0% | Two PointersString |
| Number of Dice Rolls With Target Sum | Medium | 62.2% | 50.0% | Dynamic Programming |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 50.0% | ArrayBinary SearchDynamic Programming+1 |
| Word Ladder | Hard | 44.9% | 50.0% | Hash TableStringBreadth-First Search |
| Optimal Account Balancing | Hard | 50.3% | 50.0% | |
| Design Tic-Tac-Toe | Medium | 58.7% | 50.0% | |
| Best Time to Buy and Sell Stock IV | Hard | 49.5% | 50.0% | ArrayDynamic Programming |
| Min Stack | Medium | 57.7% | 50.0% | StackDesign |
| Maximum Subarray | Medium | 53.0% | 50.0% | ArrayDivide and ConquerDynamic Programming |
| Two Sum | Easy | 57.1% | 50.0% | ArrayHash Table |
| Transform to Chessboard | Hard | 51.1% | 50.0% | ArrayMathBit Manipulation+1 |
| Time Based Key-Value Store | Medium | 49.7% | 50.0% | Hash TableStringBinary Search+1 |
| Design A Leaderboard | Medium | 68.1% | 50.0% | |
| Critical Connections in a Network | Hard | 59.3% | 50.0% | Depth-First SearchGraph TheoryBiconnected Component |