Search⌘ K
AI Features

Solution: Find All Anagrams in a String

Explore the method to find all starting indexes of anagrams of a given string within another string. Understand the use of sliding windows and hash maps to compare character counts efficiently while maintaining optimal time and space 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
...