Find All Anagrams in a String

Read the lesson → understand the pattern → then code. Tutor works offline (built-in teacher); optional Cursor/Gemini keys upgrade chat quality.

Topic refresher: Sliding Window — Live Range

Maintain [L,R] that satisfies a constraint; answer from length/sum/counts.

int L = 0;
for (int R = 0; R < n; R++) {
    // add s[R]
    while (/* invalid */) { /* remove s[L] */ L++; }
    // update answer
}

Medium

6/6

MediumSliding WindowLeetCode #438

Find All Anagrams

Fixed window = p.length(). Compare freq maps (or match counter).

Example 1

Input

cbaebabacd abc

Output

0 6

Example 2

Input

abab ab

Output

0 1 2

C++17Autosaves