| Maximum Subarray | Medium | 53.0% |
| Majority Element | Easy | 66.1% |
| Median of Two Sorted Arrays | Hard | 46.0% |
| Kth Largest Element in an Array | Medium | 68.8% |
| Convert Sorted Array to Binary Search Tree | Easy | 75.2% |
| Sort an Array | Medium | 55.9% |
| Special Binary String | Hard | 79.3% |
| Top K Frequent Elements | Medium | 65.9% |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | 68.4% |
| Range Sum Query - Mutable | Medium | 42.6% |
| Threshold Majority Queries | Hard | 21.7% |
| Merge k Sorted Lists | Hard | 58.9% |
| Reverse Bits | Easy | 67.8% |
| Create Sorted Array through Instructions | Hard | 41.4% |
| Search a 2D Matrix II | Medium | 56.9% |
| Convert Sorted List to Binary Search Tree | Medium | 66.0% |
| K Closest Points to Origin | Medium | 68.8% |
| Reverse Pairs | Hard | 33.7% |
| Sort List | Medium | 63.9% |
| Balance a Binary Search Tree | Medium | 86.3% |
| Longest Substring with At Least K Repeating Characters | Medium | 46.1% |
| Longest Balanced Subarray II | Hard | 33.8% |
| XOR After Range Multiplication Queries II | Hard | 37.2% |
| Construct Binary Tree from Inorder and Postorder Traversal | Medium | 68.1% |
| Count of Smaller Numbers After Self | Hard | 43.3% |
| Longest Balanced Subarray I | Medium | 65.7% |
| Count of Range Sum | Hard | 38.3% |
| Number of Pairs Satisfying Inequality | Hard | 46.8% |
| Maximum Sum Circular Subarray | Medium | 49.5% |
| Number of 1 Bits | Easy | 76.4% |
| The Skyline Problem | Hard | 45.0% |
| Wiggle Sort II | Medium | 37.0% |
| Construct Quad Tree | Medium | 78.1% |
| Super Pow | Medium | 36.4% |
| Construct Binary Tree from Preorder and Postorder Traversal | Medium | 78.1% |
| Beautiful Array | Medium | 68.7% |
| Count the Number of K-Big Indices | Hard | 53.6% |
| Longest Nice Substring | Easy | 63.8% |
| XOR After Range Multiplication Queries I | Medium | 73.9% |
| Minimum Cost to Partition a Binary String | Hard | |
| Number of Ships in a Rectangle | Hard | 68.9% |
| Count Good Triplets in an Array | Hard | 65.8% |
| Query Kth Smallest Trimmed Number | Medium | 47.1% |
| Number of Ways to Reorder Array to Get Same BST | Hard | 54.0% |
| Count Subarrays With Majority Element I | Medium | |
| Fill a Special Grid | Medium | 70.7% |
| Longest Increasing Subsequence II | Hard | 26.0% |
| Maximize Subarray Sum After Removing All Occurrences of One Element | Hard | 22.9% |
| Maximum Sum of Subsequence With Non-adjacent Elements | Hard | 15.4% |
| Design Most Recently Used Queue | Medium | 77.8% |
| Find Kth Largest XOR Coordinate Value | Medium | 64.2% |
| Count Subarrays With More Ones Than Zeros | Medium | 49.1% |
| Find the Kth Largest Integer in the Array | Medium | 47.6% |
| Maximum Binary Tree | Medium | 86.3% |
| Find Array Given Subset Sums | Hard | 49.5% |