How to approach it in O(n)

#1

Any hint

https://online.codingblocks.com/player/16783/content/4010/5389

#2

Hi

Hint
Approach uses hashing.

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

Hit like if you get it
Cheers!

#3

Hi

if your doubt is cleared please mark it resolved in your online course.

#4

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.