Solution: Find All Anagrams in a String
Understand how to identify all starting indices of anagrams of a given string within another string. Learn to apply a sliding window technique with character count hash maps to efficiently compare character frequencies and solve this problem with linear time complexity.
We'll cover the following...
We'll cover the following...
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:
-
a.length,b.length