Add LeetCode 1588 (Tahanima#90)

Author: Tahanima

Algorithms/Easy/1588_SumOfAllOddLengthSubarrays/Solution.c

@@ -0,0 +1,20 @@
+int sumOddLengthSubarrays(int* arr, int arrSize){
+    int ans = 0;
+    
+    for (int len = 1; len <= arrSize; len += 2) {
+        int sum = 0;
+        
+        for (int i = 0; i < len; i++) {
+            sum += arr[i];
+        }
+        
+        ans += sum;
+        
+        for (int i = len; i < arrSize; i++) {
+            sum += (arr[i] - arr[i - len]);
+            ans += sum;
+        }
+    }
+        
+    return ans;
+}

Algorithms/Easy/1588_SumOfAllOddLengthSubarrays/Solution.cpp

@@ -0,0 +1,20 @@
+class Solution {
+public:
+    int sumOddLengthSubarrays(vector<int>& arr) {
+        int ans = 0, n = arr.size();
+        
+        for (int len = 1; len <= n; len += 2) {
+            int sum = 0;
+            for (int i = 0; i < len; i++) {
+                sum += arr[i];
+            }
+            ans += sum;
+            for (int i = len; i < n; i++) {
+                sum += (arr[i] - arr[i - len]);
+                ans += sum;
+            }
+        }
+        
+        return ans;
+    }
+};

Algorithms/Easy/1588_SumOfAllOddLengthSubarrays/Solution.cs

@@ -0,0 +1,19 @@
+public class Solution {
+    public int SumOddLengthSubarrays(int[] arr) {
+        int ans = 0, n = arr.Length;
+        
+        for (int len = 1; len <= n; len += 2) {
+            int sum = 0;
+            for (int i = 0; i < len; i++) {
+                sum += arr[i];
+            }
+            ans += sum;
+            for (int i = len; i < n; i++) {
+                sum += (arr[i] - arr[i - len]);
+                ans += sum;
+            }
+        }
+        
+        return ans;
+    }
+}

Algorithms/Easy/1588_SumOfAllOddLengthSubarrays/Solution.java

@@ -0,0 +1,19 @@
+class Solution {
+    public int sumOddLengthSubarrays(int[] arr) {
+       int ans = 0, n = arr.length;
+        
+        for (int len = 1; len <= n; len += 2) {
+            int sum = 0;
+            for (int i = 0; i < len; i++) {
+                sum += arr[i];
+            }
+            ans += sum;
+            for (int i = len; i < n; i++) {
+                sum += (arr[i] - arr[i - len]);
+                ans += sum;
+            }
+        }
+        
+        return ans; 
+    }
+}