| Separate Black and White Balls | Medium | 64.0% |
| Move Zeroes | Easy | 63.6% |
| String Compression | Medium | 59.6% |
| Next Permutation | Medium | 44.8% |
| Happy Number | Easy | 59.3% |
| Longest Palindromic Substring | Medium | 37.4% |
| Rotate Array | Medium | 44.5% |
| Remove Duplicates from Sorted Array | Easy | 62.3% |
| Merge Sorted Array | Easy | 54.4% |
| Reverse Words in a String | Medium | 55.6% |
| Assign Cookies | Easy | 54.7% |
| Maximum Width Ramp | Medium | 55.8% |
| Intersection of Two Arrays | Easy | 77.5% |
| 3Sum | Medium | 38.6% |
| Container With Most Water | Medium | 59.6% |
| Middle of the Linked List | Easy | 81.6% |
| Remove Nth Node From End of List | Medium | 51.0% |
| Valid Palindrome | Easy | 52.8% |
| Reverse String | Easy | 80.6% |
| Reverse String II | Easy | 53.4% |
| Trapping Rain Water | Hard | 66.8% |
| Linked List Cycle | Easy | 53.9% |
| 4Sum | Medium | 40.0% |
| Squares of a Sorted Array | Easy | 73.6% |
| Merge Operations to Turn Array Into a Palindrome | Medium | 68.9% |
| Remove Duplicates from Sorted Array II | Medium | 64.3% |
| Create Maximum Number | Hard | 34.7% |
| Is Subsequence | Easy | 48.9% |
| Heaters | Medium | 41.4% |
| Divide Intervals Into Minimum Number of Groups | Medium | 63.6% |
| Meeting Rooms II | Medium | 52.6% |
| Remove Element | Easy | 61.4% |
| Next Greater Element III | Medium | 35.2% |
| Permutation in String | Medium | 48.5% |
| Number of Subarrays with Bounded Maximum | Medium | 54.7% |
| Two Sum II - Input Array Is Sorted | Medium | 64.6% |
| Minimum Number of Swaps to Make the String Balanced | Medium | 78.1% |
| Sort Colors | Medium | 69.2% |
| Backspace String Compare | Easy | 49.8% |
| Longest String Chain | Medium | 62.8% |
| Intersection of Two Linked Lists | Easy | 63.2% |
| Flatten 2D Vector | Medium | 50.4% |
| Palindromic Substrings | Medium | 72.6% |
| Maximum Number of Removable Characters | Medium | 46.9% |
| Boats to Save People | Medium | 61.4% |
| Find the Duplicate Number | Medium | 64.0% |
| 3Sum Closest | Medium | 48.1% |
| Earliest Finish Time for Land and Water Rides II | Medium | |
| Earliest Finish Time for Land and Water Rides I | Easy | |
| Partition Array According to Given Pivot | Medium | 89.8% |
| Merge Strings Alternately | Easy | 82.1% |
| Palindrome Linked List | Easy | 57.5% |
| Linked List Cycle II | Medium | 57.3% |
| Find the Index of the First Occurrence in a String | Easy | 46.3% |
| Find Median from Data Stream | Hard | 54.2% |
| Find K Closest Elements | Medium | 49.4% |
| Rotate List | Medium | 41.2% |
| Reorder List | Medium | 64.6% |
| Valid Palindrome II | Easy | 44.0% |
| Interval List Intersections | Medium | 72.9% |
| Sort List | Medium | 63.9% |
| Lowest Common Ancestor of a Binary Tree III | Medium | 82.9% |
| Rotating the Box | Medium | 79.2% |
| Lexicographically Smallest Negated Permutation that Sums to Target | Medium | 30.8% |
| Partition Labels | Medium | 81.8% |
| Partition List | Medium | 60.6% |
| Sum of Square Numbers | Medium | 36.7% |
| Reverse Words in a String III | Easy | 83.9% |
| Max Number of K-Sum Pairs | Medium | 56.9% |
| Reverse Vowels of a String | Easy | 60.7% |
| Count Binary Substrings | Easy | 70.3% |
| Rearrange Array Elements by Sign | Medium | 84.5% |
| Compare Version Numbers | Medium | 46.1% |
| Two Sum IV - Input is a BST | Easy | 63.0% |
| Intersection of Two Arrays II | Easy | 59.7% |
| Find K-th Smallest Pair Distance | Hard | 46.3% |
| Swapping Nodes in a Linked List | Medium | 69.2% |
| Shortest Subarray to be Removed to Make Array Sorted | Medium | 51.3% |
| Delete the Middle Node of a Linked List | Medium | 59.5% |
| Apply Operations to an Array | Easy | 74.7% |
| Find the Celebrity | Medium | 48.9% |
| Maximum Twin Sum of a Linked List | Medium | 81.6% |
| Shortest Distance to a Character | Easy | 72.7% |
| Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 23.0% |
| Minimum Number of Moves to Make Palindrome | Hard | 52.6% |
| Number of Subsequences That Satisfy the Given Sum Condition | Medium | 49.3% |
| Count the Number of Fair Pairs | Medium | 52.7% |
| Make String a Subsequence Using Cyclic Increments | Medium | 65.7% |
| Valid Word Abbreviation | Easy | 37.0% |
| Shortest Matching Substring | Hard | 23.8% |
| Valid Triangle Number | Medium | 56.7% |
| Successful Pairs of Spells and Potions | Medium | 49.5% |
| Sort Array By Parity II | Easy | 71.2% |
| Find All K-Distant Indices in an Array | Easy | 77.4% |
| Remove Duplicates from Sorted List II | Medium | 51.3% |
| Check If N and Its Double Exist | Easy | 41.7% |
| Move Pieces to Obtain a String | Medium | 56.7% |
| Maximum Number of Tasks You Can Assign | Hard | 50.2% |
| K-diff Pairs in an Array | Medium | 45.6% |
| Shortest Unsorted Continuous Subarray | Medium | 38.0% |