Permutation In String Problem Statement

Given two strings, str1 and str2, determine whether str2 contains any permutation of str1 as a substring.

Input:

str1 = “ab” str2 = “aoba”

Output:

True

Example:

Explanation: Permutations of str1 = “ab” are [“ab”, “ba”]. Substrings of str2 = “aoba” are [“a”, “o”, “b”, “a”, “ao”, “ob”, “ba”, “aob”, “oba”, “aoba”]. The string “ba” is present, hence the output is True.

Constraints:

1

Question

Permutation In String Problem Statement

Given two strings, str1 and str2, determine whether str2 contains any permutation of str1 as a substring.

Input:

str1 = “ab”
str2 = “aoba”

Output:

True

Example:

Explanation: Permutations of str1 = “ab” are [“ab”, “ba”]. Substrings of str2 = “aoba” are [“a”, “o”, “b”, “a”, “ao”, “ob”, “ba”, “aob”, “oba”, “aoba”]. The string “ba” is present, hence the output is True.

Constraints:

1 <= T <= 10
1 <= N <= 10^4
1 <= M <= 10^4
Strings str1 and str2 consist only of lowercase letters.

Note:

You do not need to print anything, as it is managed internally. Just implement the given function to solve the problem.

Accepted Answer

Check if a string contains any permutation of another string as a substring.

Iterate through str2 with a sliding window of length str1, check if any permutation of str1 is present.
Use a hashmap to store the frequency of characters in str1 and str2 for comparison.
If the frequencies of characters in the sliding window match the frequencies of characters in str1, return True.