From 4f0cedd8fc0283df8ba1778df0c43b6a8d444541 Mon Sep 17 00:00:00 2001
From: Ankush1oo8 <ankushchudiwal@outlook.com>
Date: Mon, 11 Mar 2024 20:16:37 +0530
Subject: [PATCH] sliding window protocol

---
 Heap/slidingWindow.java | 41 +++++++++++++++++++++++++++++++++++++++++
 1 file changed, 41 insertions(+)
 create mode 100644 Heap/slidingWindow.java

diff --git a/Heap/slidingWindow.java b/Heap/slidingWindow.java
new file mode 100644
index 0000000..a69a320
--- /dev/null
+++ b/Heap/slidingWindow.java
@@ -0,0 +1,41 @@
+package Heap;
+
+import java.util.*;
+public class slidingWindow {
+  static class pair implements Comparable<pair>{
+    int val;
+    int idx;
+    pair(int val, int idx){
+      this.val=val;
+      this.idx=idx;
+
+    }
+    @Override
+    public int compareTo(pair p2){
+      return p2.val-this.val;
+    }
+  }
+  public static void main(String[] args) {
+    int arr[]={1,3,-1,-3,5,3,6,7};
+    int k=3;
+    int res[]=new int[arr.length-k+1];
+
+    PriorityQueue<pair>p=new PriorityQueue<>();
+     for(int i=0;i<k;i++){
+      p.add(new pair(arr[i],i));
+
+     }
+     res[0]=p.peek().val;
+     for(int i=k;i<arr.length;i++){
+      while(p.size()>0 && p.peek().idx<=(i-k)){
+        p.remove();
+      }
+      p.add(new pair(arr[i],i));
+      res[i-k+1]=p.peek().val;
+     }
+     for(int i=0;i<res.length;i++){
+      System.out.println(res[i]);
+     }
+  }
+  
+}
\ No newline at end of file