2574. Left and Right Sum Differences

class Solution {
    public int[] leftRightDifference(int[] nums) {

        int n = nums.length;
        int[] answer = new int[n];

        int totalSum = 0;

        for (int num : nums) {
            totalSum += num;
        }

        int leftSum = 0;
        int rightSum = totalSum;

        for (int i = 0; i < n; i++) {

            rightSum -= nums[i];

            answer[i] = Math.abs(leftSum - rightSum);

            leftSum += nums[i];
        }

        return answer;
    }
}

class Solution:
    def leftRightDifference(self, nums):

        n = len(nums)
        answer = [0] * n

        total_sum = sum(nums)

        left_sum = 0
        right_sum = total_sum

        for i in range(n):

            right_sum -= nums[i]

            answer[i] = abs(left_sum - right_sum)

            left_sum += nums[i]

        return answer

class Solution {
public:
    vector<int> leftRightDifference(vector<int>& nums) {

        int n = nums.size();

        vector<int> answer(n);

        int totalSum = 0;

        for (int num : nums) {
            totalSum += num;
        }

        int leftSum = 0;
        int rightSum = totalSum;

        for (int i = 0; i < n; i++) {

            rightSum -= nums[i];

            answer[i] = abs(leftSum - rightSum);

            leftSum += nums[i];
        }

        return answer;
    }
};

var leftRightDifference = function(nums) {

    const n = nums.length;

    const answer = new Array(n);

    let totalSum = 0;

    for (const num of nums) {
        totalSum += num;
    }

    let leftSum = 0;
    let rightSum = totalSum;

    for (let i = 0; i < n; i++) {

        rightSum -= nums[i];

        answer[i] = Math.abs(leftSum - rightSum);

        leftSum += nums[i];
    }

    return answer;
};