| Reverse Pairs | Hard | 33.7% |
| Range Sum Query - Mutable | Medium | 42.6% |
| Create Sorted Array through Instructions | Hard | 41.3% |
| The Skyline Problem | Hard | 45.0% |
| Count of Smaller Numbers After Self | Hard | 43.3% |
| Count of Range Sum | Hard | 38.3% |
| Queue Reconstruction by Height | Medium | 74.6% |
| Number of Longest Increasing Subsequence | Medium | 51.3% |
| Range Module | Hard | 44.7% |
| My Calendar I | Medium | 58.2% |
| My Calendar II | Medium | 62.9% |
| My Calendar III | Hard | 71.4% |
| Count Number of Teams | Medium | 70.2% |
| Subarrays Distinct Element Sum of Squares II | Hard | 22.7% |
| Maximum Balanced Subsequence Sum | Hard | 25.7% |
| Find Building Where Alice and Bob Can Meet | Hard | 52.2% |
| Separate Squares II | Hard | 60.0% |
| Number of Pairs Satisfying Inequality | Hard | 46.8% |
| Maximize Subarrays After Removing One Conflicting Pair | Hard | 64.7% |
| Fruits Into Baskets II | Easy | 70.2% |
| Fruits Into Baskets III | Medium | 38.9% |
| Minimum Stability Factor of Array | Hard | 20.2% |
| Falling Squares | Hard | 47.3% |
| Longest Balanced Subarray I | Medium | 65.6% |
| Longest Balanced Subarray II | Hard | 33.8% |
| Find a Value of a Mysterious Function Closest to Target | Hard | 47.0% |
| Distribute Elements Into Two Arrays II | Hard | 30.3% |
| Block Placement Queries | Hard | 18.4% |
| Count Good Triplets in an Array | Hard | 65.8% |
| Count Integers in Intervals | Hard | 35.6% |
| Number of Subarrays With AND Value of K | Hard | 35.0% |
| Rectangle Area II | Hard | 55.9% |
| Fancy Sequence | Hard | 18.6% |
| Booking Concert Tickets in Groups | Hard | 19.1% |
| Longest Uploaded Prefix | Medium | 54.7% |
| Minimum Sum of Values by Dividing Array | Hard | 27.8% |
| Longest Increasing Subsequence II | Hard | 26.0% |
| Maximum Sum of Subsequence With Non-adjacent Elements | Hard | 15.4% |
| Maximum Area Rectangle With Point Constraints I | Medium | 51.3% |
| Maximize Subarray Sum After Removing All Occurrences of One Element | Hard | 22.9% |
| Count Non-Decreasing Subarrays After K Operations | Hard | 23.7% |
| Maximum Area Rectangle With Point Constraints II | Hard | 23.7% |
| Make Array Empty | Hard | 26.6% |
| Shortest Path in a Weighted Tree | Hard | 42.1% |
| Minimum Number of Valid Strings to Form Target I | Medium | 21.7% |
| Online Majority Element In Subarray | Hard | 40.1% |
| Delivering Boxes from Storage to Ports | Hard | 40.0% |
| Longest Substring of One Repeating Character | Hard | 34.1% |
| Range Frequency Queries | Medium | 42.1% |
| Find X Value of Array II | Hard | 30.5% |
| Find Subarray With Bitwise OR Closest to K | Hard | 30.8% |
| Peaks in Array | Hard | 27.1% |
| Handling Sum Queries After Update | Hard | 30.5% |