LeetCode 2574: Left and Right Sum Differences Solution

Master LeetCode problem 2574 (Left and Right Sum Differences), 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.

2574. Left and Right Sum Differences

Easy

Array Prefix Sum

Problem Explanation

Explanation:

To solve this problem, we need to calculate the left sum and right sum for each index in the array. Then, we can calculate the absolute difference between the left sum and the right sum for each index to get the result array.

Initialize arrays leftSum and rightSum with size n.
Iterate through the array from left to right, calculating the cumulative sum and storing it in leftSum.
Iterate through the array from right to left, calculating the cumulative sum and storing it in rightSum.
Calculate the absolute difference between leftSum and rightSum for each index to get the result array.

Time complexity: O(n) where n is the size of the input array. Space complexity: O(n) for the two extra arrays leftSum and rightSum.

Solution Code

class Solution {
    public int[] findSumDifference(int[] nums) {
        int n = nums.length;
        int[] leftSum = new int[n];
        int[] rightSum = new int[n];
        
        int sum = 0;
        for (int i = 0; i < n; i++) {
            leftSum[i] = sum;
            sum += nums[i];
        }
        
        sum = 0;
        for (int i = n - 1; i >= 0; i--) {
            rightSum[i] = sum;
            sum += nums[i];
        }
        
        int[] answer = new int[n];
        for (int i = 0; i < n; i++) {
            answer[i] = Math.abs(leftSum[i] - rightSum[i]);
        }
        
        return answer;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2574 (Left and Right Sum Differences)?

This page provides optimized solutions for LeetCode problem 2574 (Left and Right Sum Differences) 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 2574 (Left and Right Sum Differences)?

The time complexity for LeetCode 2574 (Left and Right Sum Differences) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2574 on DevExCode?

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

Back to LeetCode Solutions