LeetCode 1588: Sum of All Odd Length Subarrays Solution

Master LeetCode problem 1588 (Sum of All Odd Length Subarrays), a easy challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

1588. Sum of All Odd Length Subarrays

Easy

Array Math Prefix Sum

Problem Explanation

Explanation:

Algorithmic Idea:
1. For each element in the array, we calculate the number of subarrays it can contribute to with odd length.
2. The number of subarrays an element at index i can contribute to is (i + 1) * (n - i) where n is the length of the array.
3. We iterate through the array, calculate the sum of each element multiplied by the number of subarrays it can contribute to, and sum them up.
Time Complexity: O(n)
Space Complexity: O(1)

Solution Code

class Solution {
    public int sumOddLengthSubarrays(int[] arr) {
        int sum = 0;
        int n = arr.length;
        
        for (int i = 0; i < n; i++) {
            int contribution = (i + 1) * (n - i);
            sum += (contribution + 1) / 2 * arr[i];
        }
        
        return sum;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 1588 (Sum of All Odd Length Subarrays)?

This page provides optimized solutions for LeetCode problem 1588 (Sum of All Odd Length Subarrays) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 1588 (Sum of All Odd Length Subarrays)?

The time complexity for LeetCode 1588 (Sum of All Odd Length Subarrays) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1588 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 1588 in Java, C++, or Python.

Back to LeetCode Solutions