Find All Anagrams in a String
-
Algorithms and Data Structures: TheAlgorist.com
-
System Design: DistributedComputing.dev
-
Low Level Design: LowLevelDesign.io
-
Frontend Engineering: FrontendEngineering.io
Problem Statement:
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.
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".
Solution:
Prerequisite: Sliding Window
Algorithm:
This is a Premium content.
Please subscribe to the Algorithms course to access the detailed Algorithm discussion.
Java Solution:
This is a Premium content.
Please subscribe to Algorithms course to access the code.
Python Solution:
This is a Premium content.
Please subscribe to Algorithms course to access the code.
Related Other Problems:
- Grumpy Bartender
- Longest Substring With Atmost Two Distinct Characters
- Longest Substring With Atmost K Distinct Characters
- Longest Substring Without Repeating Characters
Instructor:
If you have any feedback, please use this form: https://thealgorists.com/Feedback.
