| 3 | Longest Substring Without Repeating Characters | — | Medium | Hash TableStringSliding Window | 37% | |
| 30 | Substring with Concatenation of All Words | — | Hard | Hash TableStringSliding Window | 33% | |
| 76 | Minimum Window Substring | — | Hard | Hash TableStringSliding Window | 45% | |
| 187 | Repeated DNA Sequences | — | Medium | Hash TableStringBit Manipulation | 51% | |
| 209 | Minimum Size Subarray Sum | — | Medium | ArrayBinary SearchSliding Window | 49% | |
| 219 | Contains Duplicate II | — | Easy | ArrayHash TableSliding Window | 49% | |
| 220 | Contains Duplicate IIIread | — | Hard | ArraySliding WindowSorting | 24% | |
| 239 | Sliding Window Maximum | — | Hard | ArrayQueueSliding Window | 47% | |
| 395 | Longest Substring with At Least K Repeating Charactersread | — | Medium | Hash TableStringDivide and Conquer | 45% | |
| 413 | Arithmetic Slices | — | Medium | ArrayDynamic ProgrammingSliding Window | 65% | |
| 424 | Longest Repeating Character Replacement | — | Medium | Hash TableStringSliding Window | 57% | |
| 438 | Find All Anagrams in a String | — | Medium | Hash TableStringSliding Window | 52% | |
| 480 | Sliding Window Medianread | — | Hard | ArrayHash TableSliding Window | 39% | |
| 567 | Permutation in Stringread | — | Medium | Hash TableTwo PointersString | 47% | |
| 594 | Longest Harmonious Subsequence | — | Easy | ArrayHash TableSliding Window | 57% | |
| 632 | Smallest Range Covering Elements from K Lists | — | Hard | ArrayHash TableGreedy | 70% | |
| 643 | Maximum Average Subarray I | — | Easy | ArraySliding Window | 45% | |
| 658 | Find K Closest Elements | — | Medium | ArrayTwo PointersBinary Search | 49% | |
| 689 | Maximum Sum of 3 Non-Overlapping Subarrays | — | Hard | ArrayDynamic ProgrammingSliding Window | 59% | |
| 713 | Subarray Product Less Than K | — | Medium | ArrayBinary SearchSliding Window | 53% | |
| 718 | Maximum Length of Repeated Subarray | — | Medium | ArrayBinary SearchDynamic Programming | 51% | |
| 837 | New 21 Game | — | Medium | MathDynamic ProgrammingSliding Window | 45% | |
| 862 | Shortest Subarray with Sum at Least K | — | Hard | ArrayBinary SearchQueue | 32% | |
| 904 | Fruit Into Baskets | — | Medium | ArrayHash TableSliding Window | 46% | |
| 930 | Binary Subarrays With Sum | — | Medium | ArrayHash TableSliding Window | 66% | |
| 978 | Longest Turbulent Subarray | — | Medium | ArrayDynamic ProgrammingSliding Window | 48% | |
| 992 | Subarrays with K Different Integers | — | Hard | ArrayHash TableSliding Window | 66% | |
| 995 | Minimum Number of K Consecutive Bit Flips | — | Hard | ArrayBit ManipulationQueue | 62% | |
| 1004 | Max Consecutive Ones IIIread | — | Medium | ArrayBinary SearchSliding Window | 66% | |
| 1031 | Maximum Sum of Two Non-Overlapping Subarrays | — | Medium | ArrayDynamic ProgrammingSliding Window | 60% | |
| 1040 | Moving Stones Until Consecutive II | — | Medium | ArrayMathSliding Window | 57% | |
| 1044 | Longest Duplicate Substring | — | Hard | StringBinary SearchSliding Window | 31% | |
| 1052 | Grumpy Bookstore Owner | — | Medium | ArraySliding Window | 64% | |
| 1156 | Swap For Longest Repeated Character Substringread | — | Medium | Hash TableStringSliding Window | 44% | |
| 1208 | Get Equal Substrings Within Budgetread | — | Medium | StringBinary SearchSliding Window | 59% | |
| 1234 | Replace the Substring for Balanced Stringread | — | Medium | StringSliding Window | 39% | |
| 1248 | Count Number of Nice Subarraysread | — | Medium | ArrayHash TableMath | 73% | |
| 1297 | Maximum Number of Occurrences of a Substringread | — | Medium | Hash TableStringSliding Window | 53% | |
| 1343 | Number of Sub-arrays of Size K and Average Greater than or Equal to Thresholdread | — | Medium | ArraySliding Window | 70% | |
| 1358 | Number of Substrings Containing All Three Characters | — | Medium | Hash TableStringSliding Window | 73% | |
| 1423 | Maximum Points You Can Obtain from Cards | — | Medium | ArraySliding WindowPrefix Sum | 55% | |
| 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% | |
| 1456 | Maximum Number of Vowels in a Substring of Given Length | — | Medium | StringSliding Window | 60% | |
| 1477 | Find Two Non-overlapping Sub-arrays Each With Target Sumread | — | Medium | ArrayHash TableBinary Search | 36% | |
| 1493 | Longest Subarray of 1's After Deleting One Elementread | — | Medium | ArrayDynamic ProgrammingSliding Window | 69% | |
| 1499 | Max Value of Equation | — | Hard | ArrayQueueSliding Window | 44% | |
| 1610 | Maximum Number of Visible Pointsread | — | Hard | ArrayMathGeometry | 38% | |
| 1652 | Defuse the Bombread | — | Easy | ArraySliding Window | 79% | |
| 1658 | Minimum Operations to Reduce X to Zeroread | — | Medium | ArrayHash TableBinary Search | 40% | |