| 239 | Sliding Window Maximum | — | Hard | ArrayQueueSliding Window | 47% | |
| 862 | Shortest Subarray with Sum at Least K | — | Hard | ArrayBinary SearchQueue | 32% | |
| 918 | Maximum Sum Circular Subarray | — | Medium | ArrayDivide and ConquerDynamic Programming | 47% | |
| 1425 | Constrained Subsequence Sumread | — | Hard | ArrayDynamic ProgrammingQueue | 56% | |
| 1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | — | Medium | ArrayQueueSliding Window | 57% | |
| 1499 | Max Value of Equation | — | Hard | ArrayQueueSliding Window | 44% | |
| 1687 | Delivering Boxes from Storage to Ports | — | Hard | ArrayDynamic ProgrammingSegment Tree | 39% | |
| 1696 | Jump Game VI | — | Medium | ArrayDynamic ProgrammingQueue | 46% | |
| 2071 | Maximum Number of Tasks You Can Assign | — | Hard | ArrayTwo PointersBinary Search | 51% | |
| 2398 | Maximum Number of Robots Within Budget | — | Hard | ArrayBinary SearchQueue | 37% | |
| 2407 | Longest Increasing Subsequence II | — | Hard | ArrayDivide and ConquerDynamic Programming | 25% | |
| 2444 | Count Subarrays With Fixed Bounds | — | Hard | ArrayQueueSliding Window | 69% | |
| 2762 | Continuous Subarrays | — | Medium | ArrayQueueSliding Window | 58% | |
| 2944 | Minimum Number of Coins for Fruits | — | Medium | ArrayDynamic ProgrammingQueue | 46% | |
| 2945 | Find Maximum Non-decreasing Array Length | — | Hard | ArrayBinary SearchDynamic Programming | 17% | |
| 3420 | Count Non-Decreasing Subarrays After K Operations | — | Hard | ArrayStackSegment Tree | 20% | |