diff --git a/Algorithms/Easy/1588_SumOfAllOddLengthSubarrays/Solution.cs b/Algorithms/Easy/1588_SumOfAllOddLengthSubarrays/Solution.cs
new file mode 100644
index 0000000..d8f4d40
--- /dev/null
+++ b/Algorithms/Easy/1588_SumOfAllOddLengthSubarrays/Solution.cs
@@ -0,0 +1,15 @@
+public class Solution {
+    public int SumOddLengthSubarrays(int[] arr) {
+        int sum = 0;
+
+        int l = arr.Length;
+
+        for (int i = 0; i < l; i++) 
+            for (int j = i; j < l; j += 2) 
+                for (int k = i; k <= j; k++) 
+                    sum += arr[k];
+
+        return sum; 
+        
+    }
+}
\ No newline at end of file
diff --git a/Algorithms/Easy/1588_SumOfAllOddLengthSubarrays/solution.py b/Algorithms/Easy/1588_SumOfAllOddLengthSubarrays/solution.py
new file mode 100644
index 0000000..dace3e9
--- /dev/null
+++ b/Algorithms/Easy/1588_SumOfAllOddLengthSubarrays/solution.py
@@ -0,0 +1,20 @@
+
+from typing import List
+
+
+class Solution:
+    def sumOddLengthSubarrays(self, arr: List[int]) -> int:
+        result = 0
+        array_size = len(arr)
+
+        for i in range(array_size):
+            j = i
+            while j < array_size:
+                k = i
+                while k <= j:
+                    result = result + arr[k]
+                    k += 1
+                j += 2
+        
+        return result
+