| Next Greater Element I | Easy | 75.7% |
| Daily Temperatures | Medium | 68.3% |
| Maximum Width Ramp | Medium | 55.8% |
| Remove K Digits | Medium | 36.4% |
| Trapping Rain Water | Hard | 66.8% |
| Sum of Subarray Minimums | Medium | 38.3% |
| Create Maximum Number | Hard | 34.6% |
| Largest Rectangle in Histogram | Hard | 49.3% |
| Maximal Rectangle | Hard | 58.1% |
| Shortest Unsorted Continuous Subarray | Medium | 38.0% |
| Online Stock Span | Medium | 68.7% |
| Remove Duplicate Letters | Medium | 52.8% |
| 132 Pattern | Medium | 34.5% |
| Next Greater Element II | Medium | 67.9% |
| Car Fleet | Medium | 54.7% |
| Odd Even Jump | Hard | 41.1% |
| Construct Binary Search Tree from Preorder Traversal | Medium | 84.1% |
| Next Greater Node In Linked List | Medium | 63.8% |
| Smallest Subsequence of Distinct Characters | Medium | 63.1% |
| Number of Visible People in a Queue | Hard | 72.3% |
| Minimum Number of Increments on Subarrays to Form a Target Array | Hard | 78.1% |
| Shortest Subarray to be Removed to Make Array Sorted | Medium | 51.3% |
| Sum of Subarray Ranges | Medium | 60.7% |
| Sum of Total Strength of Wizards | Hard | 29.1% |
| Remove Nodes From Linked List | Medium | 74.8% |
| Beautiful Towers II | Medium | 36.2% |
| Find Maximum Non-decreasing Array Length | Hard | 18.5% |
| Find the Number of Subarrays Where Boundary Elements Are Maximum | Hard | 32.8% |
| Subarray With Elements Greater Than Varying Threshold | Hard | 45.2% |
| Max Chunks To Make Sorted | Medium | 64.1% |
| Minimum Operations to Make Array Equal to Target | Hard | 41.3% |
| Find Building Where Alice and Bob Can Meet | Hard | 52.2% |
| Maximum Subarray Min-Product | Medium | 40.0% |
| Max Chunks To Make Sorted II | Hard | 54.7% |
| Final Prices With a Special Discount in a Shop | Easy | 84.0% |
| Maximum Balanced Shipments | Medium | 61.3% |
| Minimum Operations to Convert All Elements to Zero | Medium | 52.9% |
| Count Submatrices With All Ones | Medium | 71.1% |
| Count Bowl Subarrays | Medium | 47.9% |
| Car Fleet II | Hard | 57.7% |
| Maximum Score of a Good Subarray | Hard | 64.4% |
| Minimum Cost Tree From Leaf Values | Medium | 67.8% |
| Minimum Number of Visited Cells in a Grid | Hard | 23.6% |
| Smallest K-Length Subsequence With Occurrences of a Letter | Hard | 39.6% |
| Find the Most Competitive Subsequence | Medium | 52.7% |
| The Number of Weak Characters in the Game | Medium | 44.5% |
| Count Non-Decreasing Subarrays After K Operations | Hard | 23.7% |
| Apply Operations to Maximize Score | Hard | 53.7% |
| Make Array Non-decreasing | Medium | 56.7% |
| Longest Well-Performing Interval | Medium | 37.0% |
| Steps to Make Array Non-decreasing | Medium | 24.6% |
| Beautiful Towers I | Medium | 44.3% |
| Maximum Binary Tree | Medium | 86.3% |
| Lexicographically Smallest String After Deleting Duplicate Characters | Hard | 18.9% |