| 209 | Minimum Size Subarray Sum | — | Medium | ArrayBinary SearchSliding Window | 49% | |
| 238 | Product of Array Except Self | — | Medium | ArrayPrefix Sum | 68% | |
| 253 | Meeting Rooms II | — | Medium | ArrayTwo PointersGreedy | 52% | |
| 303 | Range Sum Query - Immutable | — | Easy | ArrayDesignPrefix Sum | 68% | |
| 304 | Range Sum Query 2D - Immutable | — | Medium | ArrayDesignMatrix | 56% | |
| 363 | Max Sum of Rectangle No Larger Than Kread | — | Hard | ArrayBinary SearchMatrix | 45% | |
| 410 | Split Array Largest Sum | — | Hard | ArrayBinary SearchDynamic Programming | 58% | |
| 497 | Random Point in Non-overlapping Rectanglesread | — | Medium | ArrayMathBinary Search | 38% | |
| 523 | Continuous Subarray Sum | — | Medium | ArrayHash TableMath | 31% | |
| 525 | Contiguous Array | — | Medium | ArrayHash TablePrefix Sum | 49% | |
| 528 | Random Pick with Weightread | — | Medium | ArrayMathBinary Search | 48% | |
| 560 | Subarray Sum Equals K | — | Medium | ArrayHash TablePrefix Sum | 45% | |
| 689 | Maximum Sum of 3 Non-Overlapping Subarrays | — | Hard | ArrayDynamic ProgrammingSliding Window | 59% | |
| 713 | Subarray Product Less Than K | — | Medium | ArrayBinary SearchSliding Window | 53% | |
| 724 | Find Pivot Index | — | Easy | ArrayPrefix Sum | 60% | |
| 731 | My Calendar II | — | Medium | ArrayBinary SearchDesign | 62% | |
| 732 | My Calendar III | — | Hard | Binary SearchDesignSegment Tree | 71% | |
| 798 | Smallest Rotation with Highest Score | — | Hard | ArrayPrefix Sum | 52% | |
| 813 | Largest Sum of Averages | — | Medium | ArrayDynamic ProgrammingPrefix Sum | 54% | |
| 848 | Shifting Letters | — | Medium | ArrayStringPrefix Sum | 45% | |
| 862 | Shortest Subarray with Sum at Least K | — | Hard | ArrayBinary SearchQueue | 32% | |
| 903 | Valid Permutations for DI Sequence | — | Hard | StringDynamic ProgrammingPrefix Sum | 57% | |
| 930 | Binary Subarrays With Sum | — | Medium | ArrayHash TableSliding Window | 66% | |
| 974 | Subarray Sums Divisible by K | — | Medium | ArrayHash TablePrefix Sum | 56% | |
| 995 | Minimum Number of K Consecutive Bit Flips | — | Hard | ArrayBit ManipulationQueue | 62% | |
| 1000 | Minimum Cost to Merge Stones | — | Hard | ArrayDynamic ProgrammingPrefix Sum | 44% | |
| 1004 | Max Consecutive Ones III | — | Medium | ArrayBinary SearchSliding Window | 66% | |
| 1074 | Number of Submatrices That Sum to Target | — | Hard | ArrayHash TableMatrix | 74% | |
| 1094 | Car Pooling | — | Medium | ArraySortingHeap (Priority Queue) | 56% | |
| 1109 | Corporate Flight Bookings | — | Medium | ArrayPrefix Sum | 64% | |
| 1124 | Longest Well-Performing Interval | — | Medium | ArrayHash TableStack | 36% | |
| 1140 | Stone Game II | — | Medium | ArrayMathDynamic Programming | 73% | |
| 1177 | Can Make Palindrome from Substring | — | Medium | ArrayHash TableString | 40% | |
| 1208 | Get Equal Substrings Within Budget | — | Medium | StringBinary SearchSliding Window | 59% | |
| 1248 | Count Number of Nice Subarrays | — | Medium | ArrayHash TableMath | 73% | |
| 1292 | Maximum Side Length of a Square with Sum Less than or Equal to Threshold | — | Medium | ArrayBinary SearchMatrix | 53% | |
| 1310 | XOR Queries of a Subarray | — | Medium | ArrayBit ManipulationPrefix Sum | 78% | |
| 1314 | Matrix Block Sum | — | Medium | ArrayMatrixPrefix Sum | 76% | |
| 1352 | Product of the Last K Numbers | — | Medium | ArrayMathDesign | 63% | |
| 1371 | Find the Longest Substring Containing Vowels in Even Counts | — | Medium | Hash TableStringBit Manipulation | 76% | |
| 1413 | Minimum Value to Get Positive Step by Step Sum | — | Easy | ArrayPrefix Sum | 65% | |
| 1420 | Build Array Where You Can Find The Maximum Exactly K Comparisons | — | Hard | Dynamic ProgrammingPrefix Sum | 67% | |
| 1422 | Maximum Score After Splitting a String | — | Easy | StringPrefix Sum | 65% | |
| 1423 | Maximum Points You Can Obtain from Cards | — | Medium | ArraySliding WindowPrefix Sum | 55% | |
| 1442 | Count Triplets That Can Form Two Arrays of Equal XOR | — | Medium | ArrayHash TableMath | 85% | |
| 1444 | Number of Ways of Cutting a Pizza | — | Hard | ArrayDynamic ProgrammingMemoization | 62% | |
| 1480 | Running Sum of 1d Array | — | Easy | ArrayPrefix Sum | 87% | |
| 1508 | Range Sum of Sorted Subarray Sums | — | Medium | ArrayTwo PointersBinary Search | 63% | |
| 1524 | Number of Sub-arrays With Odd Sum | — | Medium | ArrayMathDynamic Programming | 56% | |
| 1546 | Maximum Number of Non-Overlapping Subarrays With Sum Equals Target | — | Medium | ArrayHash TableGreedy | 48% | |