Skip to content

Sliding Window

Directory actions

More options

Directory actions

More options

Latest commit

 

History

History

Sliding Window

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
1. Maximum points you can Obtain from cards.md
1. Maximum points you can Obtain from cards.md
 
 
2. Longest Substring Without Repeating Characters .md
2. Longest Substring Without Repeating Characters .md
 
 
3. 1004. Max Consecutive Ones III.md
3. 1004. Max Consecutive Ones III.md
 
 
4. Fruit Into Baskets.md
4. Fruit Into Baskets.md
 
 
5. 1358. Number of Substrings Containing All Three Characters .md
5. 1358. Number of Substrings Containing All Three Characters .md
 
 
6. Binary Subarrays With Sum.md
6. Binary Subarrays With Sum.md
 
 
7. Count Number of Nice Subarrays.md
7. Count Number of Nice Subarrays.md
 
 
8. Subarrays with K Different Integers.md
8. Subarrays with K Different Integers.md
 
 
9. Minimum Window Substring.md
9. Minimum Window Substring.md
 
 
readme.md
readme.md
 
 

readme.md

Sliding windows By Striver

Patterns :

We do have 6 patterns in Sliding window Pattern !

  1. Constant Window
  2. Longest Subarray /substring where < condition>
  3. No. of Subarrays where < condition>.
  4. Finding The shortest / minimum window < condition >

Template for most of the Questions.

l = 0, r= 0 , sum = 0 , ans =0;

while(l <r){
	sum+=arr[r];
	if(valid){
		// update answer accordingly
	}

	while(Ans Is Not valid){
		// Make it valid , by moving pointers 
		// or with any of your logic.
	}
}