From dfe3cad072a1bb4b67c75c17d02367fcef054284 Mon Sep 17 00:00:00 2001
From: Vishesht27 <72491817+Vishesht27@users.noreply.github.com>
Date: Sat, 17 Oct 2020 23:45:05 +0530
Subject: [PATCH] Sliding Window in java

Using array ,deque and linkedlist
---
 SlidingWindow.java | 61 ++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 61 insertions(+)
 create mode 100644 SlidingWindow.java

diff --git a/SlidingWindow.java b/SlidingWindow.java
new file mode 100644
index 00000000..dd3042e9
--- /dev/null
+++ b/SlidingWindow.java
@@ -0,0 +1,61 @@
+
+import java.util.Deque;
+import java.util.LinkedList;
+public class Slidingwindow {
+
+
+	
+
+
+
+	
+
+		public static void main(String[] args) {
+			Solution solution= new Solution();
+			int a[]= {4,3,1,2,5,3,4,7,1,9};
+			int ans[]=  solution.maxSlidingWindow(a, 4);
+			
+			for(int x:ans) {
+				System.out.print(x+" ");
+			}
+			}
+			static	class Solution {
+				    public int[] maxSlidingWindow(int[] a, int k) {
+		               int n= a.length;
+				    	Deque<Integer>dq=new LinkedList<>();		         
+			   int ans[]=new int[n-k+1];
+			   
+			   
+			   int i=0;
+			   for(;i<k;i++) {
+		              while(!dq.isEmpty()&& a[dq.peekLast()]<=a[i])	{
+		            	  dq.removeLast();
+		              }
+			   dq.addLast(i);
+			   }
+			   for(;i<n;i++) {
+				   
+				   ans[i-k]=a[dq.peekFirst()];
+			   
+			   while(!dq.isEmpty() &&  dq.peekFirst()<=i-k) {
+			   dq.removeFirst();
+			   
+			   }
+			   
+			   while(!dq.isEmpty()&& a[dq.peekLast()]<=a[i])	{
+		     	  dq.removeLast();
+		       }
+		dq.addLast(i);
+			   }   
+		ans[i-k]=a[ dq.peekFirst()];
+		return ans;
+				    
+				    
+				    
+				    
+				    
+				}  
+
+		}
+
+	}