0003 | Longest Substring Without Repeating Characters | Go | Medium | O(n) | O(1) | ❤️ | 31.6% |
0076 | Minimum Window Substring | Go | Hard | O(n) | O(n) | ❤️ | 36.2% |
0239 | Sliding Window Maximum | Go | Hard | O(n * k) | O(n) | ❤️ | 44.8% |
0395 | Longest Substring with At Least K Repeating Characters | Go | Medium | | | | 43.7% |
0424 | Longest Repeating Character Replacement | Go | Medium | O(n) | O(1) | | 48.4% |
0480 | Sliding Window Median | Go | Hard | O(n * log k) | O(k) | ❤️ | 38.9% |
0567 | Permutation in String | Go | Medium | O(n) | O(1) | ❤️ | 44.5% |
0978 | Longest Turbulent Subarray | Go | Medium | O(n) | O(1) | ❤️ | 46.7% |
0992 | Subarrays with K Different Integers | Go | Hard | O(n) | O(n) | ❤️ | 50.9% |
0995 | Minimum Number of K Consecutive Bit Flips | Go | Hard | O(n) | O(1) | ❤️ | 50.1% |
1004 | Max Consecutive Ones III | Go | Medium | O(n) | O(1) | | 60.9% |
1040 | Moving Stones Until Consecutive II | Go | Medium | O(n log n) | O(1) | ❤️ | 54.2% |
1052 | Grumpy Bookstore Owner | Go | Medium | O(n log n) | O(1) | | 55.9% |
1074 | Number of Submatrices That Sum to Target | Go | Hard | O(n^3) | O(n) | ❤️ | 62.1% |
1208 | Get Equal Substrings Within Budget | Go | Medium | | | | 44.3% |
1423 | Maximum Points You Can Obtain from Cards | Go | Medium | | | | 46.9% |
1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Go | Medium | | | | 44.4% |
1658 | Minimum Operations to Reduce X to Zero | Go | Medium | | | | 33.3% |
———— | ——————————————————- | ——- | —————- | ————— | ————- | ————- | ————- |