Software Engineer

Our intuition here is to go through each sliding window and keep track of the maximum element in each sliding window. To implement the same we run two nested loops, where the outer loop which will mark the starting point of the subarray of length k, the inner loop will run from the starting INDEX to INDEX + K, K elements from starting index and store the maximum element among these K elements into the answer.

The first and the foremost condition for two strings to be the permutations of each other is that the frequency of each element in both of them should be the same.
It can be proven by a very simple argument that we are only rearranging the letters, and not adding or deleting any character.
So we allocate an array of size 256 (that is the number of distinct ASCIIacharactersterst to store the frequency.
For the first string, we increase the frequency of each of the characters and for the second one, we decrease one for every character encountered.
In the end, we check that each of the elements of this frequency array is 0 (total additions by the first string are exactly nullified by the second string).
If it is not zero we return false else we return true.