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.