Search⌘ K
AI Features

Solution: Find All Anagrams in a String

Explore how to find all starting indexes of anagrams of one string within another by using a sliding window and hash maps for character counting. Learn to compare character frequencies instead of substrings directly, handle edge cases, and implement an efficient solution 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
...