| Longest Substring Without Repeating Characters | Medium | 38.5% |
| Find All Anagrams in a String | Medium | 53.3% |
| Contains Duplicate II | Easy | 50.8% |
| Replace the Substring for Balanced String | Medium | 40.6% |
| Minimum Window Substring | Hard | 47.0% |
| Fruit Into Baskets | Medium | 50.5% |
| Sliding Window Maximum | Hard | 48.5% |
| Longest Repeating Character Replacement | Medium | 59.1% |
| Permutation in String | Medium | 48.5% |
| Count Subarrays Where Max Element Appears at Least K Times | Medium | 62.4% |
| Max Consecutive Ones III | Medium | 67.3% |
| Minimum Swaps to Group All 1's Together II | Medium | 65.6% |
| Arithmetic Slices | Medium | 64.8% |
| Subarray Product Less Than K | Medium | 53.9% |
| Contains Duplicate III | Hard | 24.5% |
| Minimum Window Subsequence | Hard | 43.8% |
| Constrained Subsequence Sum | Hard | 56.4% |
| Maximum Coins From K Consecutive Bags | Medium | 24.5% |
| Find K Closest Elements | Medium | 49.4% |
| Maximum Average Subarray I | Easy | 47.1% |
| Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | 57.4% |
| Jump Game VII | Medium | 26.4% |
| Minimum Size Subarray Sum | Medium | 51.1% |
| Subarrays with K Different Integers | Hard | 67.6% |
| Substring with Concatenation of All Words | Hard | 34.0% |
| Defuse the Bomb | Easy | 79.3% |
| Minimum Operations to Reduce X to Zero | Medium | 40.4% |
| Frequency of the Most Frequent Element | Medium | 44.6% |
| Maximum Points You Can Obtain from Cards | Medium | 57.3% |
| Longest Substring with At Least K Repeating Characters | Medium | 46.1% |
| Binary Subarrays With Sum | Medium | 68.3% |
| Maximum Number of Vowels in a Substring of Given Length | Medium | 61.6% |
| Divide an Array Into Subarrays With Minimum Cost II | Hard | 54.7% |
| Repeated DNA Sequences | Medium | 52.9% |
| Minimum Removals to Balance Array | Medium | 47.9% |
| Minimum Subarray Length With Distinct Sum At Least K | Medium | |
| Sliding Subarray Beauty | Medium | 36.4% |
| Count Number of Nice Subarrays | Medium | 74.8% |
| Count Subarrays With Fixed Bounds | Hard | 69.2% |
| Smallest Range Covering Elements from K Lists | Hard | 70.1% |
| Maximum Sum of Distinct Subarrays With Length K | Medium | 42.8% |
| Maximum Erasure Value | Medium | 64.1% |
| Count Zero Request Servers | Medium | 35.6% |
| Shortest Subarray with Sum at Least K | Hard | 32.6% |
| Number of Substrings Containing All Three Characters | Medium | 73.5% |
| Longest Subarray of 1's After Deleting One Element | Medium | 71.1% |
| Find the Median of the Uniqueness Array | Hard | 29.9% |
| Longest Harmonious Subsequence | Easy | 64.4% |
| Minimum Difference Between Highest and Lowest of K Scores | Easy | 66.2% |
| New 21 Game | Medium | 52.0% |
| Longest Substring with At Most K Distinct Characters | Medium | 49.9% |
| Longest Duplicate Substring | Hard | 31.1% |
| Grumpy Bookstore Owner | Medium | 64.0% |
| Reschedule Meetings for Maximum Free Time I | Medium | 53.9% |
| Sliding Window Median | Hard | 38.9% |
| Maximum Number of Robots Within Budget | Hard | 38.0% |
| Longest Nice Subarray | Medium | 64.8% |
| Continuous Subarrays | Medium | 57.9% |
| Maximum Sum of 3 Non-Overlapping Subarrays | Hard | 59.7% |
| Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | Medium | 72.3% |
| Maximum Length of Repeated Subarray | Medium | 51.3% |
| Count Complete Subarrays in an Array | Medium | 75.9% |
| Minimum Operations to Make Binary Array Elements Equal to One I | Medium | 80.4% |
| Number of Smooth Descent Periods of a Stock | Medium | 67.7% |
| Smallest Subarrays With Maximum Bitwise OR | Medium | 62.0% |
| Take K of Each Character From Left and Right | Medium | 51.5% |
| Maximum Sum of Two Non-Overlapping Subarrays | Medium | 60.8% |
| Count Partitions With Max-Min Difference at Most K | Medium | 58.8% |
| Maximum Frequency of an Element After Performing Operations I | Medium | 40.1% |
| Find X-Sum of All K-Long Subarrays I | Easy | 76.1% |
| Best Time to Buy and Sell Stock using Strategy | Medium | 59.8% |
| Count the Number of Good Subarrays | Medium | 65.9% |
| Length of the Longest Valid Substring | Hard | 38.2% |
| Longest Turbulent Subarray | Medium | 48.9% |
| Substrings of Size Three with Distinct Characters | Easy | 76.6% |
| Alternating Groups I | Easy | 68.8% |
| Count of Substrings Containing Every Vowel and K Consonants II | Medium | 40.6% |
| Maximum Difference Between Even and Odd Frequency II | Hard | 48.7% |
| Minimum Recolors to Get K Consecutive Black Blocks | Easy | 68.6% |
| Count Subarrays With Score Less Than K | Hard | 62.3% |
| Maximum Frequency of an Element After Performing Operations II | Hard | 53.9% |
| Maximum Fruits Harvested After at Most K Steps | Hard | 61.0% |
| Maximize the Minimum Powered City | Hard | 61.8% |
| Length of Longest Subarray With at Most K Frequency | Medium | 56.4% |
| Find Longest Special Substring That Occurs Thrice I | Medium | 61.9% |
| Find K-Length Substrings With No Repeated Characters | Medium | 76.5% |
| Diet Plan Performance | Easy | 55.9% |
| Maximum Sum of Almost Unique Subarray | Medium | 40.8% |
| Distinct Numbers in Each Subarray | Medium | 77.3% |
| Longest Nice Substring | Easy | 63.8% |
| Longest Substring with At Most Two Distinct Characters | Medium | 57.0% |
| Maximum Beauty of an Array After Applying Operation | Medium | 58.3% |
| Maximum Number of Visible Points | Hard | 38.0% |
| Maximum Number of Occurrences of a Substring | Medium | 54.3% |
| Count Substrings That Can Be Rearranged to Contain a String I | Medium | 42.7% |
| Minimum Number of Flips to Make the Binary String Alternating | Medium | 41.1% |
| Minimum Number of K Consecutive Bit Flips | Hard | 62.2% |
| Maximize the Confusion of an Exam | Medium | 69.7% |
| Minimum Swaps to Group All 1's Together | Medium | 61.2% |
| Find the Power of K-Size Subarrays I | Medium | 62.1% |