Please help me with the approach of this question

[be10046.19 (Vivek jha)]

please help me with the approach of this question

[asaurabh_26 (logical coder)]

approach

1. First check if the length of string is less than the length of the given pattern, if yes then “ no such window can exist “.
2. Store the occurrence of characters of the given pattern in a hash_pat[].
3. Start matching the characters of pattern with the characters of string i.e. increment count if a character matches.
4. Check if (count == length of pattern ) this means a window is found.
5. If such window found, try to minimize it by removing extra characters from the beginning of the current window.
6. Update min_length.
7. Print the minimum length window.