| Sliding Window Maximum | Hard | 48.5% |
| Constrained Subsequence Sum | Hard | 56.4% |
| Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | 57.4% |
| Count Subarrays With Fixed Bounds | Hard | 69.2% |
| Maximum Sum Circular Subarray | Medium | 49.5% |
| Shortest Subarray with Sum at Least K | Hard | 32.6% |
| Maximum Number of Robots Within Budget | Hard | 38.0% |
| Continuous Subarrays | Medium | 57.9% |
| Maximum Number of Tasks You Can Assign | Hard | 50.2% |
| Find Maximum Non-decreasing Array Length | Hard | 18.5% |
| Count Partitions With Max-Min Difference at Most K | Medium | 58.8% |
| Jump Game VI | Medium | 46.4% |
| Count Non-Decreasing Subarrays After K Operations | Hard | 23.8% |
| Longest Increasing Subsequence II | Hard | 26.0% |
| Max Value of Equation | Hard | 45.0% |
| K Empty Slots | Hard | 37.9% |
| Count Prime-Gap Balanced Subarrays | Medium | 22.5% |
| Delivering Boxes from Storage to Ports | Hard | 40.1% |