solved on 14/9/23

Author: Priyanshu-Ganatra

.vscode/settings.json

@@ -0,0 +1,7 @@
+{
+    "files.associations": {
+        "sqroot": "python",
+        "ostream": "cpp",
+        "iostream": "cpp"
+    }
+}

CS_26_LongestSubarrayWithSumKOnlyPositives.cpp

@@ -0,0 +1,44 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int longestSubarrayWithSumK(vector<int> a, long long k)
+{
+    int left = 0, right = 0;
+    long long sum = a[0];
+    int maxLen = 0;
+    int n = a.size();
+
+    while (right < n)
+    {
+        while (left <= right && sum > k)
+        {
+            sum -= a[left];
+            left++;
+        }
+        if (sum == k)
+        {
+            maxLen = max(maxLen, right - left + 1);
+        }
+        right++;
+        if (right < n)
+            sum += a[right];
+    }
+    return maxLen;
+}
+
+int main()
+{
+    int n;
+    cout << "Enter the size of the array: ";
+    cin >> n;
+    vector<int> arr(n);
+    cout << "Enter the elements of the array: ";
+    for (int i = 0; i < n; i++)
+        cin >> arr[i];
+    long long k;
+    cout << "Enter the value of k: ";
+    cin >> k;
+    cout << "The length of the longest subarray with sum k is: ";
+    cout << longestSubarrayWithSumK(arr, k) << endl;
+    return 0;
+}

CS_27_LongestSubarrayWithSumKPositives&Negatives.cpp

@@ -0,0 +1,45 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int getLongestSubarray(vector<int> &a, int k)
+{
+    map<int, int> preSumMap;
+    int sum = 0;
+    int maxLen = 0;
+    for (int i = 0; i < a.size(); i++)
+    {
+        sum += a[i];
+        if (sum == k)
+        {
+            maxLen = i + 1;
+        }
+        int rem = sum - k;
+        if (preSumMap.find(rem) != preSumMap.end())
+        {
+            int len = i - preSumMap[rem];
+            maxLen = max(len, maxLen);
+        }
+        if (preSumMap.find(sum) == preSumMap.end())
+        {
+            preSumMap[sum] = i;
+        }
+    }
+    return maxLen;
+}
+
+int main()
+{
+    int n;
+    cout << "Enter the size of the array: ";
+    cin >> n;
+    vector<int> arr(n);
+    cout << "Enter the elements of the array: ";
+    for (int i = 0; i < n; i++)
+        cin >> arr[i];
+    int k;
+    cout << "Enter the value of k: ";
+    cin >> k;
+    cout << "The length of the longest subarray with sum k is: ";
+    cout << getLongestSubarray(arr, k) << endl;
+    return 0;
+}

CS_28_CountAllSubarraysWithSumK.cpp

@@ -0,0 +1,42 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int findAllSubarraysWithGivenSum(vector<int> &arr, int k)
+{
+    long long sum = arr[0];
+    int left = 0, right = 0, count = 0;
+    int n = arr.size();
+
+    while (right < n)
+    {
+        while (left <= right && sum > k)
+        {
+            sum -= arr[left];
+            left++;
+        }
+        if (sum == k)
+            count++;
+        right++;
+        if (right < n)
+            sum += arr[right];
+    }
+
+    return count;
+}
+
+int main()
+{
+    int n;
+    cout << "Enter the size of the array: ";
+    cin >> n;
+    vector<int> arr(n);
+    cout << "Enter the elements of the array: ";
+    for (int i = 0; i < n; i++)
+        cin >> arr[i];
+    int k;
+    cout << "Enter the value of k: ";
+    cin >> k;
+    cout << "The number of subarrays with sum k is: ";
+    cout << findAllSubarraysWithGivenSum(arr, k) << endl;
+    return 0;
+}