| Longest Subarray of 1's After Deleting One Element | Medium | 71.1% | 100.0% |
| Maximize Distance to Closest Person | Medium | 49.6% | 88.8% |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 83.5% |
| Find K Closest Elements | Medium | 49.4% | 83.0% |
| Subarray Sum Equals K | Medium | 46.8% | 79.8% |
| String Compression | Medium | 59.6% | 79.2% |
| Merge Intervals | Medium | 51.2% | 78.6% |
| One Edit Distance | Medium | 34.6% | 72.9% |
| Permutation in String | Medium | 48.5% | 72.0% |
| Line Reflection | Medium | 36.3% | 71.1% |
| Longest Palindromic Substring | Medium | 37.4% | 70.2% |
| Find All Anagrams in a String | Medium | 53.3% | 69.2% |
| Find the Prefix Common Array of Two Arrays | Medium | 87.0% | 68.2% |
| Number of Islands | Medium | 63.8% | 67.1% |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 67.1% |
| Group Anagrams | Medium | 72.2% | 65.9% |
| Interval List Intersections | Medium | 72.9% | 63.4% |
| Design an ATM Machine | Medium | 44.6% | 60.4% |
| Find Duplicate Subtrees | Medium | 60.6% | 58.8% |
| Min Stack | Medium | 57.7% | 56.9% |
| Max Consecutive Ones III | Medium | 67.3% | 54.9% |
| Binary Tree Right Side View | Medium | 69.5% | 54.9% |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.8% | 54.9% |
| Product of Array Except Self | Medium | 68.6% | 54.9% |
| Container With Most Water | Medium | 59.6% | 52.7% |
| Perfect Squares | Medium | 56.3% | 52.7% |
| LRU Cache | Medium | 46.8% | 52.7% |
| Longest Substring with At Most K Distinct Characters | Medium | 49.9% | 50.1% |
| Search in Rotated Sorted Array | Medium | 44.1% | 50.1% |
| Generate Parentheses | Medium | 78.3% | 50.1% |
| Design Hit Counter | Medium | 69.6% | 50.1% |
| Count Substrings Without Repeating Character | Medium | 76.1% | 50.1% |
| Maximum Subarray | Medium | 53.0% | 47.2% |
| Add Two Numbers | Medium | 48.0% | 43.8% |
| Basic Calculator II | Medium | 46.7% | 43.8% |
| Simplify Path | Medium | 50.0% | 43.8% |
| Longest Repeating Character Replacement | Medium | 59.1% | 43.8% |
| Binary Tree Zigzag Level Order Traversal | Medium | 63.2% | 39.5% |
| 4Sum | Medium | 40.0% | 39.5% |
| Longest Increasing Subsequence | Medium | 59.1% | 39.5% |
| Product of Two Run-Length Encoded Arrays | Medium | 59.6% | 39.5% |
| Lowest Common Ancestor of a Binary Search Tree | Medium | 70.1% | 34.2% |
| Continuous Subarray Sum | Medium | 31.2% | 34.2% |
| Letter Combinations of a Phone Number | Medium | 65.5% | 34.2% |
| Remove Nth Node From End of List | Medium | 51.0% | 34.2% |
| Find Minimum in Rotated Sorted Array | Medium | 53.8% | 34.2% |
| Binary Tree Level Order Traversal | Medium | 72.2% | 34.2% |
| Two Sum II - Input Array Is Sorted | Medium | 64.6% | 26.7% |
| Longest Substring with At Least K Repeating Characters | Medium | 46.1% | 26.7% |
| Reverse Integer | Medium | 31.5% | 26.7% |
| Coin Change | Medium | 48.0% | 26.7% |
| Daily Temperatures | Medium | 68.4% | 26.7% |
| Implement Rand10() Using Rand7() | Medium | 46.2% | 26.7% |
| Swap Nodes in Pairs | Medium | 69.0% | 26.7% |
| Lowest Common Ancestor of a Binary Tree III | Medium | 82.9% | 26.7% |
| Minimum Size Subarray Sum | Medium | 51.1% | 26.7% |
| Cinema Seat Allocation | Medium | 43.6% | 26.7% |
| Rotting Oranges | Medium | 58.2% | 26.7% |
| Spiral Matrix | Medium | 56.2% | 26.7% |
| Subarray Sums Divisible by K | Medium | 56.1% | 26.7% |
| Validate Binary Search Tree | Medium | 35.4% | 26.7% |
| Search a 2D Matrix | Medium | 53.6% | 26.7% |
| Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | 57.4% | 26.7% |
| Evaluate Reverse Polish Notation | Medium | 57.1% | 26.7% |
| Zigzag Iterator | Medium | 66.5% | 26.7% |
| Meeting Scheduler | Medium | 55.2% | 26.7% |
| Top K Frequent Elements | Medium | 65.9% | 26.7% |
