Package g0401_0500.s0438_find_all_anagrams_in_a_string

Class Solution

java.lang.Object

g0401_0500.s0438_find_all_anagrams_in_a_string.Solution

public class Solution
extends Object

438 - Find All Anagrams in a String\. Medium 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. **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 substring with start index = 0 is "ab", which is an anagram of "ab". The substring with start index = 1 is "ba", which is an anagram of "ab". The substring with start index = 2 is "ab", which is an anagram of "ab". **Constraints:** * 1 <= s.length, p.length <= 3 * 104 * `s` and `p` consist of lowercase English letters.

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
List<Integer>	findAnagrams(String s, String p)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

findAnagrams

public List<Integer> findAnagrams(String s,
 String p)