Solution: Find All Anagrams in a String

Let's solve the Find All Anagrams in a String problem using the Knowing What to Track pattern.

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 3×103\leq 3 \times 10^3
  • Both a and b consist only of lowercase English letters.

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.