| Find the Student that Will Replace the Chalk | Medium | 53.2% |
| Random Pick with Weight | Medium | 48.9% |
| Median of Two Sorted Arrays | Hard | 45.9% |
| Find First and Last Position of Element in Sorted Array | Medium | 48.3% |
| Find Peak Element | Medium | 46.8% |
| Longest Increasing Subsequence | Medium | 59.0% |
| Peak Index in a Mountain Array | Medium | 66.9% |
| Search a 2D Matrix | Medium | 53.5% |
| Nth Digit | Medium | 37.1% |
| Koko Eating Bananas | Medium | 49.7% |
| Search Insert Position | Easy | 50.7% |
| Find the Duplicate Number | Medium | 64.0% |
| Intersection of Two Arrays | Easy | 77.5% |
| Search in Rotated Sorted Array II | Medium | 39.7% |
| Search in Rotated Sorted Array | Medium | 44.1% |
| Sqrt(x) | Easy | 41.4% |
| Two Sum II - Input Array Is Sorted | Medium | 64.6% |
| Missing Number | Easy | 71.6% |
| First Bad Version | Easy | 46.8% |
| Reverse Pairs | Hard | 33.7% |
| Single Element in a Sorted Array | Medium | 59.2% |
| Find K Closest Elements | Medium | 49.4% |
| Subarray Product Less Than K | Medium | 53.9% |
| Binary Search | Easy | 60.5% |
| Preimage Size of Factorial Zeroes Function | Hard | 46.6% |
| Search Suggestions System | Medium | 65.2% |
| Plates Between Candles | Medium | 47.3% |
| Max Consecutive Ones III | Medium | 67.3% |
| Count Complete Tree Nodes | Easy | 72.0% |
| Threshold Majority Queries | Hard | 21.7% |
| Heaters | Medium | 41.4% |
| Split Array Largest Sum | Hard | 59.8% |
| Capacity To Ship Packages Within D Days | Medium | 73.5% |
| Find the Smallest Divisor Given a Threshold | Medium | 65.4% |
| Maximum Profit in Job Scheduling | Hard | 54.6% |
| Time Based Key-Value Store | Medium | 49.7% |
| Create Sorted Array through Instructions | Hard | 41.3% |
| Maximum Number of Removable Characters | Medium | 46.8% |
| Find Minimum in Rotated Sorted Array | Medium | 53.8% |
| Find Minimum in Rotated Sorted Array II | Hard | 44.6% |
| Minimum Size Subarray Sum | Medium | 51.0% |
| Search a 2D Matrix II | Medium | 56.8% |
| Count of Smaller Numbers After Self | Hard | 43.3% |
| Count of Range Sum | Hard | 38.3% |
| Intersection of Two Arrays II | Easy | 59.7% |
| Russian Doll Envelopes | Hard | 37.7% |
| Valid Perfect Square | Easy | 44.7% |
| Guess Number Higher or Lower | Easy | 57.1% |
| Kth Smallest Element in a Sorted Matrix | Medium | 64.4% |
| Find Right Interval | Medium | 55.4% |
| Arranging Coins | Easy | 48.0% |
| 132 Pattern | Medium | 34.5% |
| K-diff Pairs in an Array | Medium | 45.6% |
| Valid Triangle Number | Medium | 56.7% |
| Sum of Square Numbers | Medium | 36.7% |
| Maximum Length of Repeated Subarray | Medium | 51.2% |
| Find K-th Smallest Pair Distance | Hard | 46.3% |
| My Calendar I | Medium | 58.2% |
| My Calendar II | Medium | 62.9% |
| My Calendar III | Hard | 71.4% |
| Find Smallest Letter Greater Than Target | Easy | 58.9% |
| Reach a Number | Medium | 44.6% |
| Swim in Rising Water | Hard | 67.6% |
| K-th Smallest Prime Fraction | Medium | 69.0% |
| Number of Matching Subsequences | Medium | 50.6% |
| Most Profit Assigning Work | Medium | 56.1% |
| Shortest Subarray with Sum at Least K | Hard | 32.6% |
| Nth Magical Number | Hard | 36.4% |
| Super Egg Drop | Hard | 29.8% |
| Fair Candy Swap | Easy | 64.5% |
| Numbers At Most N Given Digit Set | Hard | 44.5% |
| Longest Arithmetic Subsequence | Medium | 49.9% |
| Longest Duplicate Substring | Hard | 31.1% |
| Find in Mountain Array | Hard | 41.1% |
| Snapshot Array | Medium | 36.7% |
| Minimum Garden Perimeter to Collect Enough Apples | Medium | 55.5% |
| Kth Ancestor of a Tree Node | Hard | 37.1% |
| Maximum Side Length of a Square with Sum Less than or Equal to Threshold | Medium | 65.5% |
| The K Weakest Rows in a Matrix | Easy | 74.3% |
| Check If N and Its Double Exist | Easy | 41.6% |
| Count Negative Numbers in a Sorted Matrix | Easy | 79.5% |
| Minimum Number of Days to Make m Bouquets | Medium | 56.2% |
| Number of Subsequences That Satisfy the Given Sum Condition | Medium | 49.3% |
| Kth Missing Positive Number | Easy | 63.2% |
| Magnetic Force Between Two Balls | Medium | 71.9% |
| Shortest Subarray to be Removed to Make Array Sorted | Medium | 51.3% |
| Special Array With X Elements Greater Than or Equal X | Easy | 66.8% |
| Path With Minimum Effort | Medium | 62.8% |
| Minimum Number of Removals to Make Mountain Array | Hard | 54.8% |
| Minimum Operations to Reduce X to Zero | Medium | 40.4% |
| Maximum Number of Events That Can Be Attended II | Hard | 63.6% |
| Minimum Limit of Balls in a Bag | Medium | 66.6% |
| Count Pairs Of Nodes | Hard | 42.4% |
| Closest Room | Hard | 41.1% |
| Frequency of the Most Frequent Element | Medium | 44.6% |
| Minimum Speed to Arrive on Time | Medium | 47.7% |
| Minimum Space Wasted From Packaging | Hard | 33.4% |
| Find a Peak Element II | Medium | 54.4% |
| Longest Common Subpath | Hard | 29.3% |
| Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 23.0% |