Left and Right Sum Differences

Given a 0-indexed integer array nums, find a 0-indexed integer array answer where:

• answer.length == nums.length.

• answer[i] = |leftSum[i] - rightSum[i]|.

Where:

• leftSum[i] is the sum of elements to the left of the index i in the array nums. If there is no such element, leftSum[i] = 0.

• rightSum[i] is the sum of elements to the right of the index i in the array nums. If there is no such element, rightSum[i] = 0.

Return the array answer.

LeetCode Problem - 2574

class Solution {
    public int[] leftRightDifference(int[] nums) {
        // Initialize an array to store the result
        int[] resultArr =  new int[nums.length];

        // Initialize arrays to store the left and right sums
        int[] rightSumArray = new int[nums.length];
        int[] leftSumArray = new int[nums.length];

        // Calculate left sums
        int temp = 0;
        for(int i=0; i<nums.length; i++){
            if(i != 0){
                temp += nums[i-1];
                leftSumArray[i] = temp;
            }
            else{
                leftSumArray[i] = temp;
            }
        }

        // Calculate right sums
        for(int i=0; i<nums.length; i++){
            temp = 0;
            for(int j=i+1; j<nums.length; j++){
                temp += nums[j];
            }
            rightSumArray[i] = temp;
        }

        // Calculate absolute differences between left and right sums and store them in resultArr
        for(int i=0; i<nums.length; i++){
            resultArr[i] = Math.abs(leftSumArray[i] - rightSumArray[i]);
        }
        return resultArr;
    }
}