1
class Solution {
2
  public int sumOddLengthSubarrays(int[] arr) {
3

4
    // Using two loops in this question...
5
    int sum = 0;
6
    for (int i = 0; i < arr.length; i++) {
7
      int prevSum = 0;
8
      for (int j = i; j < arr.length; j++) {
9
        prevSum += arr[j];
10
        if ((j - i + 1) % 2 == 1) {
11
          sum += prevSum;
12
        }
13
      }
14
    }
15
    // Time Complexity : O(n-square)
16
    // Space Complexity : O(1)
17
    return sum;
18
  }
19
}