We’re preparing your current view and syncing the latest data.
Given two strings s and p, return an array of all the start indices of p's anagrams in s. You may return the answer in any order. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.
Two strings s and p.
An array of integers indicating all the start indices of anagrams of p in s.
1 <= s.length, p.length <= 3 * 10^4; s and p consist of lowercase English letters.
Example 1
Input
s = "cbaebabacd", p = "abc"
Output
[0, 6]
Explanation
The substring with start index = 0 is "cba", which is an anagram of "abc". The substring with start index = 6 is "bac", which is an anagram of "abc".
Example 2
Input
s = "abab", p = "ab"
Output
[0, 1, 2]
Explanation
The substrings starting at indices 0, 1, and 2 are "ab", "ba", and "ab" respectively, all of which are anagrams of "ab".