4. 238. Product of Array Except Self

Product of Array Except Self O(n) Time Complexity O(1) Space Complexity - Product of Array Except Self - LeetCodeLeetCode

Time: O(n) Space: O(1)

var productExceptSelf = function(nums) {
    const products = new Array(nums.length).fill(1);

    for (let i = 1; i < nums.length; i++) {
        products[i] = nums[i - 1] * products[i - 1];
    }

    let acc = 1;
    for (let i = nums.length - 1; i >= 0; i--) {
        products[i] = products[i] * acc;
        acc = acc * nums[i]; 
    }

    return products;
};

Time: O(n)

Space: O(n)

/**
 * @param {number[]} nums
 * @return {number[]}
 */
var productExceptSelf = function(nums) {
    const left = new Array(nums.length).fill(1);
    const right = new Array(nums.length).fill(1);

    // 1   1   2   6
    // 24   12  4  1

    for (let i = 1; i < nums.length; i++) {
        left[i] = nums[i - 1] * left[i - 1];
    }

    for (let i = nums.length - 2; i >= 0; i--) {
        right[i] = nums[i + 1] * right[i + 1]; 
    }

    const products = [];
    for (let i = 0; i < nums.length; i++) {
        products[i] = left[i] * right[i];
    }

    return products;
};