Count Anagrammatic Substrings
Count the number of anagrammatic substrings from one string present in another.
Input: s = "abab", p = "ab"
Output: [0, 1, 2]
Explanation: The substrings "ab", "ba", and "ab" starting at indices 0, 1, and 2 respectively are all anagrams of the string "ab".

Question

Count Anagrammatic Substrings

Count the number of anagrammatic substrings from one string present in another.

Input: s = "abab", p = "ab"

Output: [0, 1, 2]

Explanation: The substrings "ab", "ba", and "ab" starting at indices 0, 1, and 2 respectively are all anagrams of the string "ab".

Anonymous · Accepted Answer

//i will try to create a menthod by passing string value and substring and will return in the list format To perform the substring i will use sliding window technic public static List findAnagarams(String s, String p){ List result = new ArrayList<>(); if(s==null || p==null || p.length()>s.length()){ return result; } int n = s.length(); int m = p.length(); //i will assume all the characters as lower case int[] pCount = new int[26]; int[] windowCount = new int[26]; //counts for p first window for(int i=0;i

Count Anagrammatic Substrings

Practice this question with AI

Go Premium

Community Answers

Unlock Full Access

Practice More Questions