| Text Justification | Hard | 50.5% | 100.0% | ArrayStringSimulation |
| Length of Longest V-Shaped Diagonal Segment | Hard | 56.3% | 98.9% | ArrayDynamic ProgrammingMemoization+1 |
| Rotating the Box | Medium | 79.2% | 96.7% | ArrayTwo PointersMatrix |
| Two Sum | Easy | 57.1% | 95.5% | ArrayHash Table |
| Split the Array | Easy | 60.9% | 94.2% | ArrayHash TableCounting |
| 3Sum | Medium | 38.6% | 92.9% | ArrayTwo PointersSorting |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 92.9% | Hash TableStringSliding Window |
| Minimum Operations to Write the Letter Y on a Grid | Medium | 64.3% | 92.9% | ArrayHash TableMatrix+1 |
| Find the Length of the Longest Common Prefix | Medium | 57.0% | 90.0% | ArrayHash TableString+1 |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 86.6% | ArrayDynamic Programming |
| LRU Cache | Medium | 46.8% | 86.6% | Hash TableLinked ListDesign+1 |
| Block Placement Queries | Hard | 18.4% | 82.8% | ArrayBinary SearchBinary Indexed Tree+2 |
| Create Target Array in the Given Order | Easy | 86.5% | 82.8% | ArraySimulation |
| Number of Black Blocks | Medium | 41.5% | 80.7% | ArrayHash TableEnumeration |
| Group Anagrams | Medium | 72.2% | 78.3% | ArrayHash TableString+1 |
| Simplify Path | Medium | 50.0% | 78.3% | StringStack |
| Number of Adjacent Elements With the Same Color | Medium | 58.1% | 78.3% | Array |
| Maximum Number of Events That Can Be Attended | Medium | 38.9% | 78.3% | ArrayGreedySorting+1 |
| Earliest Possible Day of Full Bloom | Hard | 71.2% | 78.3% | ArrayGreedySorting |
| Odd String Difference | Easy | 61.8% | 78.3% | ArrayHash TableString |
| Two Furthest Houses With Different Colors | Easy | 65.5% | 78.3% | ArrayGreedy |
| Match Alphanumerical Pattern in Matrix I | Medium | 64.2% | 78.3% | ArrayHash TableString+1 |
| Divisor Game | Easy | 71.6% | 78.3% | MathDynamic ProgrammingBrainteaser+1 |
| Count Nodes With the Highest Score | Medium | 52.5% | 78.3% | ArrayTreeDepth-First Search+1 |
| Merge Intervals | Medium | 51.2% | 75.7% | ArraySorting |
| Number of Divisible Triplet Sums | Medium | 67.5% | 72.8% | ArrayHash Table |
| Trapping Rain Water | Hard | 66.8% | 72.8% | ArrayTwo PointersDynamic Programming+2 |
| Maximum Subarray | Medium | 53.0% | 72.8% | ArrayDivide and ConquerDynamic Programming |
| Largest Rectangle in Histogram | Hard | 49.4% | 72.8% | ArrayStackMonotonic Stack |
| Maximum Sum of Alternating Subsequence With Distance at Least K | Hard | | 72.8% | ArrayDynamic ProgrammingSegment Tree |
| Longest Palindromic Substring | Medium | 37.4% | 69.5% | Two PointersStringDynamic Programming |
| Number of Islands | Medium | 63.8% | 69.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Valid Parentheses | Easy | 43.7% | 69.5% | StringStack |
| Beautiful Arrangement | Medium | 64.7% | 65.7% | ArrayDynamic ProgrammingBacktracking+2 |
| Longest Common Prefix | Easy | 47.1% | 65.7% | ArrayStringTrie |
| Minimum Time Difference | Medium | 62.6% | 65.7% | ArrayMathString+1 |
| Minimum Absolute Difference Between Elements With Constraint | Medium | 37.2% | 65.7% | ArrayBinary SearchOrdered Set |
| Count Palindromic Subsequences | Hard | 41.0% | 61.2% | StringDynamic Programming |
| Exclusive Time of Functions | Medium | 66.1% | 61.2% | ArrayStack |
| Spiral Matrix | Medium | 56.2% | 61.2% | ArrayMatrixSimulation |
| Reverse Linked List | Easy | 80.3% | 61.2% | Linked ListRecursion |
| Walls and Gates | Medium | 63.8% | 61.2% | ArrayBreadth-First SearchMatrix |
| Rotate Image | Medium | 79.4% | 61.2% | ArrayMathMatrix |
| Minimum Number of Swaps to Make the String Balanced | Medium | 78.1% | 55.7% | Two PointersStringStack+1 |
| Maximum OR | Medium | 42.7% | 55.7% | ArrayGreedyBit Manipulation+1 |
| Number of Perfect Pairs | Medium | 33.4% | 55.7% | ArrayMathTwo Pointers+1 |
| Divide Players Into Teams of Equal Skill | Medium | 68.9% | 55.7% | ArrayHash TableTwo Pointers+1 |
| Minimum Cost Path with Teleportations | Hard | 45.7% | 55.7% | ArrayDynamic ProgrammingMatrix |
| Course Schedule | Medium | 50.8% | 55.7% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Restore IP Addresses | Medium | 55.3% | 55.7% | StringBacktracking |
| Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | 57.4% | 55.7% | ArrayQueueSliding Window+3 |
| Happy Number | Easy | 59.3% | 55.7% | Hash TableMathTwo Pointers |
| Grid Teleportation Traversal | Medium | 23.2% | 55.7% | ArrayHash TableBreadth-First Search+1 |
| Matrix Block Sum | Medium | 76.4% | 55.7% | ArrayMatrixPrefix Sum |
| Gas Station | Medium | 47.5% | 55.7% | ArrayGreedy |
| Container With Most Water | Medium | 59.6% | 55.7% | ArrayTwo PointersGreedy |
| Merge Two Sorted Lists | Easy | 68.0% | 55.7% | Linked ListRecursion |
| Sort Colors | Medium | 69.2% | 55.7% | ArrayTwo PointersSorting |
| Subarray Sum Equals K | Medium | 46.8% | 55.7% | ArrayHash TablePrefix Sum |
| Number of Changing Keys | Easy | 80.5% | 55.7% | String |
| Sell Diminishing-Valued Colored Balls | Medium | 30.1% | 48.7% | ArrayMathBinary Search+3 |
| Check If Array Pairs Are Divisible by k | Medium | 46.2% | 48.7% | ArrayHash TableCounting |
| Diameter of Binary Tree | Easy | 65.1% | 48.7% | TreeDepth-First SearchBinary Tree |
| Image Smoother | Easy | 69.1% | 48.7% | ArrayMatrix |
| Word Ladder | Hard | 44.9% | 48.7% | Hash TableStringBreadth-First Search |
| Balanced Binary Tree | Easy | 57.9% | 48.7% | TreeDepth-First SearchBinary Tree |
| Product of Array Except Self | Medium | 68.6% | 48.7% | ArrayPrefix Sum |
| Number of Matching Subsequences | Medium | 50.6% | 48.7% | ArrayHash TableString+4 |
| Find Median from Data Stream | Hard | 54.2% | 48.7% | Two PointersDesignSorting+2 |
| Best Time to Buy and Sell Stock II | Medium | 70.8% | 48.7% | ArrayDynamic ProgrammingGreedy |
| Add Strings | Easy | 52.1% | 48.7% | MathStringSimulation |
| Top K Frequent Elements | Medium | 65.9% | 48.7% | ArrayHash TableDivide and Conquer+5 |
| Candy Crush | Medium | 77.3% | 48.7% | ArrayTwo PointersMatrix+1 |
| Partition Equal Subset Sum | Medium | 49.2% | 48.7% | ArrayDynamic Programming |
| Longest Valid Parentheses | Hard | 38.1% | 48.7% | StringDynamic ProgrammingStack |
| Add Binary | Easy | 57.7% | 48.7% | MathStringBit Manipulation+1 |
| Minimize Maximum of Array | Medium | 46.5% | 39.0% | ArrayBinary SearchDynamic Programming+2 |
| Palindrome Partitioning | Medium | 73.7% | 39.0% | StringDynamic ProgrammingBacktracking |
| Maximum Palindromes After Operations | Medium | 45.6% | 39.0% | ArrayHash TableString+3 |
| Path With Minimum Effort | Medium | 62.8% | 39.0% | ArrayBinary SearchDepth-First Search+4 |
| Minimum Suffix Flips | Medium | 73.9% | 39.0% | StringGreedy |
| Longest Non-decreasing Subarray From Two Arrays | Medium | 31.0% | 39.0% | ArrayDynamic Programming |
| Count Ways To Build Good Strings | Medium | 59.0% | 39.0% | Dynamic Programming |
| Median of Two Sorted Arrays | Hard | 46.0% | 39.0% | ArrayBinary SearchDivide and Conquer |
| Daily Temperatures | Medium | 68.4% | 39.0% | ArrayStackMonotonic Stack |
| Find Score of an Array After Marking All Elements | Medium | 64.5% | 39.0% | ArrayHash TableSorting+2 |
| Reverse Nodes in k-Group | Hard | 65.4% | 39.0% | Linked ListRecursion |
| Sliding Window Maximum | Hard | 48.5% | 39.0% | ArrayQueueSliding Window+2 |
| Longest Increasing Subsequence | Medium | 59.1% | 39.0% | ArrayBinary SearchDynamic Programming |
| Rotate Array | Medium | 44.5% | 39.0% | ArrayMathTwo Pointers |
| Edit Distance | Medium | 60.2% | 39.0% | StringDynamic Programming |
| Find Peak Element | Medium | 46.8% | 39.0% | ArrayBinary Search |
| Check if Array Is Sorted and Rotated | Easy | 55.7% | 39.0% | Array |
| Two Sum II - Input Array Is Sorted | Medium | 64.6% | 39.0% | ArrayTwo PointersBinary Search |
| Substrings of Size Three with Distinct Characters | Easy | 76.6% | 39.0% | Hash TableStringSliding Window+1 |
| Reverse Words in a String | Medium | 55.6% | 39.0% | Two PointersString |
| House Robber II | Medium | 44.6% | 39.0% | ArrayDynamic Programming |
| Number of Subarrays That Match a Pattern I | Medium | 68.4% | 39.0% | ArrayRolling HashString Matching+1 |
| LFU Cache | Hard | 48.6% | 39.0% | Hash TableLinked ListDesign+1 |
| Contains Duplicate | Easy | 64.1% | 39.0% | ArrayHash TableSorting |
| Brightest Position on Street | Medium | 60.6% | 39.0% | ArraySortingPrefix Sum+1 |
| Sum Root to Leaf Numbers | Medium | 69.6% | 39.0% | TreeDepth-First SearchBinary Tree |
| Best Time to Buy and Sell Stock using Strategy | Medium | 59.8% | 39.0% | ArraySliding WindowPrefix Sum |
| Last Stone Weight | Easy | 66.3% | 39.0% | ArrayHeap (Priority Queue) |
| Sort Characters By Frequency | Medium | 75.1% | 39.0% | Hash TableStringSorting+3 |
| Binary Tree Right Side View | Medium | 69.5% | 39.0% | TreeDepth-First SearchBreadth-First Search+1 |
| Valid Anagram | Easy | 67.8% | 39.0% | Hash TableStringSorting |
| Kth Largest Element in an Array | Medium | 68.8% | 39.0% | ArrayDivide and ConquerSorting+2 |
| Valid Palindrome II | Easy | 44.0% | 39.0% | Two PointersStringGreedy |
| Reverse Vowels of a String | Easy | 60.7% | 39.0% | Two PointersString |
| Ugly Number II | Medium | 49.5% | 39.0% | Hash TableMathDynamic Programming+1 |
| Unique Paths | Medium | 66.6% | 39.0% | MathDynamic ProgrammingCombinatorics |
| Letter Combinations of a Phone Number | Medium | 65.5% | 39.0% | Hash TableStringBacktracking |
| Rotting Oranges | Medium | 58.2% | 39.0% | ArrayBreadth-First SearchMatrix |
| Word Break | Medium | 49.1% | 39.0% | ArrayHash TableString+3 |
| Word Break II | Hard | 55.1% | 39.0% | ArrayHash TableString+4 |
| Reconstruct Itinerary | Hard | 44.3% | 39.0% | ArrayStringDepth-First Search+4 |
| Restore the Array From Adjacent Pairs | Medium | 75.1% | 39.0% | ArrayHash TableDepth-First Search |
| Candy | Hard | 48.0% | 39.0% | ArrayGreedy |
| Alternating Digit Sum | Easy | 69.0% | 39.0% | Math |
| Design Memory Allocator | Medium | 49.7% | 39.0% | ArrayHash TableDesign+1 |
| Best Time to Buy and Sell Stock III | Hard | 53.2% | 39.0% | ArrayDynamic Programming |
| Count Mentions Per User | Medium | 50.8% | 39.0% | ArrayMathSorting+1 |
| Maximal Rectangle | Hard | 58.1% | 39.0% | ArrayDynamic ProgrammingStack+2 |
| Add Digits | Easy | 68.6% | 39.0% | MathSimulationNumber Theory |
| Plus One | Easy | 49.6% | 39.0% | ArrayMath |
| Next Greater Element II | Medium | 67.9% | 39.0% | ArrayStackMonotonic Stack |
| Word Search | Medium | 46.9% | 39.0% | ArrayStringBacktracking+2 |
| Merge Sorted Array | Easy | 54.4% | 39.0% | ArrayTwo PointersSorting |
| Subarray Sums Divisible by K | Medium | 56.1% | 39.0% | ArrayHash TablePrefix Sum |
| Longest Consecutive Sequence | Medium | 47.0% | 39.0% | ArrayHash TableUnion-Find |
| Valid Palindrome | Easy | 52.8% | 39.0% | Two PointersString |
| First Unique Character in a String | Easy | 65.1% | 39.0% | Hash TableStringQueue+1 |
| Count Good Numbers | Medium | 57.4% | 39.0% | MathRecursion |
| Hand of Straights | Medium | 57.8% | 39.0% | ArrayHash TableGreedy+1 |
| Non-overlapping Intervals | Medium | 56.7% | 39.0% | ArrayDynamic ProgrammingGreedy+1 |
| Maximal Score After Applying K Operations | Medium | 64.0% | 39.0% | ArrayGreedyHeap (Priority Queue) |
| Flood Fill | Easy | 67.9% | 39.0% | ArrayDepth-First SearchBreadth-First Search+1 |
| Meeting Rooms II | Medium | 52.6% | 39.0% | ArrayTwo PointersGreedy+3 |
| Jump Game VI | Medium | 46.4% | 39.0% | ArrayDynamic ProgrammingQueue+2 |
| Capacity To Ship Packages Within D Days | Medium | 73.5% | 39.0% | ArrayBinary Search |
| Longest Common Subsequence | Medium | 58.9% | 39.0% | StringDynamic Programming |
| Binary Tree Level Order Traversal | Medium | 72.2% | 39.0% | TreeBreadth-First SearchBinary Tree |
| Word Search II | Hard | 38.1% | 39.0% | ArrayStringBacktracking+2 |
| Kth Largest Sum in a Binary Tree | Medium | 59.0% | 39.0% | TreeBreadth-First SearchSorting+1 |
| Search in Rotated Sorted Array | Medium | 44.1% | 39.0% | ArrayBinary Search |