# Leetcode 238 - Product of array except itself

Note:

• It says we cannot use Division!
• nums[i] = left product * right product.
• Build an array result, first we need to iterate from left to right, fill each element as product of left side elements while updating left *= nums[i].
• Then, we iterate from right, multiply right product while keep updating variable right *= nums[i].

Question:

Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].

The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.

You must write an algorithm that runs in O(n) time and without using the division operation.

Example:

Code: