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 ≤103a and b consist only of lowercase English letters.In this problem, we need to find the consecutive characters in string a that make up any of the anagrams of string b. For this, we’ll iterate over string a with a window of the same size as the length of string b. Along the way, if we encounter any of the anagrams of string b, we’ll store the start index of the substring that represents the anagram. How will we know we’ve encountered the anagram of string b in the string a? If the characters appearing in the ...
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 ≤103a and b consist only of lowercase English letters.In this problem, we need to find the consecutive characters in string a that make up any of the anagrams of string b. For this, we’ll iterate over string a with a window of the same size as the length of string b. Along the way, if we encounter any of the anagrams of string b, we’ll store the start index of the substring that represents the anagram. How will we know we’ve encountered the anagram of string b in the string a? If the characters appearing in the ...