Search⌘ K
AI Features

Solution: Find All Anagrams in a String

Understand how to find all start indexes of anagrams of a smaller string within a larger string by using a sliding window approach and hash maps to track character frequencies. This lesson teaches you to efficiently compare character counts instead of substrings, enabling quick detection of anagrams with linear time complexity.

Statement

Given two strings, a and b, return an array of all the start indexes of anagrams of b in a. We may return the answer in any order.

An anagram is a word or phrase created by rearranging the letters of another word or phrase while utilizing each of the original letters exactly once. For example, “act” is the anagram of “cat”, and “flow” is the anagram of “wolf”.

Constraints:

  • 11\leq a.length, b.length 103\leq 10^3
...