Changes in tasks.json and added Sliding window: Max subarray sum of size k

Author: Faisal786111

.vscode/tasks.json

@@ -1,28 +1,28 @@
 {
+    "version": "2.0.0",
     "tasks": [
         {
-            "type": "cppbuild",
-            "label": "C/C++: gcc.exe build active file",
-            "command": "C:\\MinGW\\bin\\gcc.exe",
+            "label": "Compile and Run",
+            "type": "shell",
+            "command": "cmd.exe",
             "args": [
-                "-fdiagnostics-color=always",
-                "-g",
-                "${file}",
-                "-o",
-                "${fileDirname}\\${fileBasenameNoExtension}.exe"
+                "/C",
+                "echo Compiling ${fileBasename}... && g++ \"${file}\" -o \"${fileDirname}/${fileBasenameNoExtension}.exe\" && echo Running program... && \"${fileDirname}/${fileBasenameNoExtension}.exe\" < \"${fileDirname}/input.txt\" > \"${fileDirname}/output.txt\" && echo Output saved to output.txt && type \"${fileDirname}/output.txt\""
             ],
             "options": {
-                "cwd": "C:\\MinGW\\bin"
+                "cwd": "${fileDirname}"
+            },
+            "presentation": {
+                "reveal": "always",
+                "panel": "shared",
+                "clear": true,
+                "showReuseMessage": false
             },
-            "problemMatcher": [
-                "$gcc"
-            ],
             "group": {
                 "kind": "build",
                 "isDefault": true
             },
-            "detail": "Task generated by Debugger."
+            "problemMatcher": ["$gcc"]
         }
-    ],
-    "version": "2.0.0"
-}
+    ]
+}

Algorithms/Sliding Window/Max subarr sum of size k/input.txt

@@ -0,0 +1,2 @@
+7 3  
+2 1 5 1 3 2 1  

Algorithms/Sliding Window/Max subarr sum of size k/main.cpp

@@ -0,0 +1,42 @@
+/* Problem Statement: 
+Maximum Sum Subarray of Size K
+Given an integer array arr of size n and an integer k, find the maximum sum of any contiguous subarray of size k.
+*/
+
+#include <bits/stdc++.h>
+using namespace std;
+
+void maxSumSubarray(int arr[], int n, int k){
+    int i = 0, j = 0;
+    int sum = 0; 
+    int mx = INT_MIN;
+    while(j < n){
+        sum += arr[j];
+        // Achieve window size 
+        if((j - i + 1) < k){
+            j++;
+        }else if((j - i + 1) == k){ // Maintain window size
+            mx = max(mx, sum);
+            sum -= arr[i];
+            i++;
+            j++;
+        }
+    }
+
+    cout << mx << endl;
+} 
+
+int main(){
+    int n, k;
+    cin >> n >> k;
+
+    int arr[n];
+
+    for(int i = 0; i < n; i++){
+        cin >> arr[i];
+    }
+
+    maxSumSubarray(arr, n, k);
+
+    return 0;
+}

Algorithms/Sliding Window/Max subarr sum of size k/main.exe

@@ -0,0 +1 @@
+9