滑动窗口

无重复字符的最长子串

Find the length of the longest substring without repeating characters using a sliding window and hash map to track state…

串联所有单词的子串

Find all starting indices of substrings in a string that are concatenations of a given list of words.

最小覆盖子串

Find the smallest substring of s containing all characters from t using a sliding window with running state updates for …

重复的DNA序列

Solve Repeated DNA Sequences by sliding a length-10 window and tracking seen patterns with a hash set or bitmask.

长度最小的子数组

Find the minimal length of a subarray whose sum is greater than or equal to the target using efficient algorithms.

存在重复元素 II

Check if any two equal numbers exist within k indices using array scanning and hash table lookup efficiently.

存在重复元素 III

The problem involves finding a pair of indices in an array where the index and value differences are within given limits…

滑动窗口最大值

Solve the "Sliding Window Maximum" problem using efficient techniques like the sliding window, deque, and priority queue…

至少有 K 个重复字符的最长子串

Find the length of the longest substring where every character appears at least k times using sliding window and divide-…

等差数列划分

Count the number of arithmetic subarrays in a given integer array using dynamic programming.

替换后的最长重复字符

Find the length of the longest substring after at most k replacements using a sliding window and character count trackin…

找到字符串中所有字母异位词

Find all starting indices of p's anagrams in s using sliding window and hash table approach.

滑动窗口中位数

Compute the median for each sliding window of size k in an array using efficient array scanning and hash lookup techniqu…

字符串的排列

Check if a string contains a permutation of another string using two-pointer scanning and hash table techniques.

最长和谐子序列

Find the length of the longest harmonious subsequence in an integer array using array scanning and hash-based frequency …

最小区间

Find the minimal range covering at least one number from each of k sorted lists using array scanning and hash lookup eff…

子数组最大平均数 I

Find the maximum average of any contiguous subarray of length k in a given integer array using a sliding window approach…

找到 K 个最接近的元素

Identify the k integers closest to a target x in a sorted array using binary search and two-pointer strategies efficient…

三个无重叠子数组的最大和

Maximize the sum of three non-overlapping subarrays with length k in an integer array using dynamic programming.

乘积小于 K 的子数组

Count subarrays with a product strictly less than a given value k using efficient algorithms like binary search and slid…

最长重复子数组

Find the maximum length of a subarray that appears in both given integer arrays using dynamic programming.

新 21 点

Calculate the probability Alice reaches at most n points using state transition dynamic programming efficiently.

和至少为 K 的最短子数组

Find the shortest subarray with a sum of at least k using binary search and sliding window techniques.

水果成篮

The Fruit Into Baskets problem requires finding the maximum number of fruits you can pick from a row of trees under spec…