Minimum. window substring

#1

how to get in these types of problems when to shril window when to expand is there any general way so that I can understand it…?? I am struggling in sliding window technique…

#2

There is no hard rule when to expand and when to shrink the window. Its your logic and it will come when you practise 5 to 10 questions on sliding window. Actually sliding window is a very easy concept when you practise some question because all questions follws the same pattern. No new thing will not come in this concept as dynamic programming.

#3

Can you explain how we are shriking window in this problem…

#4

Read this algorithm one time.

  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.
#5

in this question if the template string is ttlk then i have to search for ttlk or only t l and k??

#7

so repetition not allowed??only we need to consider occurence??

#8

Yes
The task is to find the smallest window length that contains all the characters of the given string at least one time
For eg. A = “ aabcbcdbca ”, then the result would be 4 as of the smallest window will be “ dbca ”.

#9

If I want all character then how to do. It??

#10

Now able to understand your doubt. One time google your question. There are many questions similar to this question.

#11

Means??? … …

#12

Sir can you clear…??

#13

If you want all character then it is also simple. The also that i give you earlier is for the all character(also for repeated ). If you dont want for repeated character then make the pattern after deleting repeting character. Both question are same with slight modification