Find all Anagrams in a String 2

Title: Custom Sort String Source: leetcode.com

Given a string s and a non-empty string p, find all the start indices of p‘s anagrams in s.

Strings consists of lowercase English letters only and the length of both strings s and p will not be larger than 20,100.

The order of output does not matter.

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”.

Python solution

Rate this post

2 thoughts on “Find all Anagrams in a String

  1. Reply leefriendstreeservice Oct 11,2020 3:14 am

    Hello just wanted to give you a quick heads up. The text in your content
    seem to be running off the screen in Opera. I’m not sure if this is a format issue or something to do with
    internet browser compatibility but I figured I’d post to let you
    know. The style and design look great though! Hope
    you get the issue solved soon. Cheers

Leave a Reply