diff --git a/Program's_Contributed_By_Contributors/SlidingWindow/First negative integer in every window of size k b/Program's_Contributed_By_Contributors/SlidingWindow/First negative integer in every window of size k
new file mode 100644
index 0000000000..b8a84a0ba0
--- /dev/null
+++ b/Program's_Contributed_By_Contributors/SlidingWindow/First negative integer in every window of size k	
@@ -0,0 +1,20 @@
+def printFirstNegativeInteger( A, N, K):
+    i=j=0
+    v=[]
+    ans=[]
+    while(j<N):
+        if A[j]<0:
+            v.append(A[j])
+        if j-i+1<K:
+            j+=1
+        else:
+            if len(v)==0:
+                ans.append(0)
+            else:
+                ans.append(v[0])
+                if A[i]==v[0]:
+                    v=v[1:]
+            
+            i+=1
+            j+=1
+    return ans
diff --git a/Program's_Contributed_By_Contributors/SlidingWindow/Maximum Sum Subarray of size K b/Program's_Contributed_By_Contributors/SlidingWindow/Maximum Sum Subarray of size K
new file mode 100644
index 0000000000..4457fdf42f
--- /dev/null
+++ b/Program's_Contributed_By_Contributors/SlidingWindow/Maximum Sum Subarray of size K	
@@ -0,0 +1,15 @@
+def getans(a,k):
+    i=j=0
+    s=0
+    ans=[]
+    while(j<len(a)):
+        s+=a[j]
+        if j-i+1<k:
+            j+=1
+        else:
+            ans.append(s)
+            s-=a[i]
+            i+=1
+            j+=1
+    return ans
+print(getans([2,5,1,8,2,9,1,6],7))