Challenge: Product of Array Except Self

Statement

You’re given an integer array, nums. Return a resultant array product so that product[i] is equal to the product of all the elements of nums except nums[i].

Write an algorithm that runs in $O(n)$ time without using the division operation.

Constraints:

• $2 \leq$ nums.length $\leq 10^3$
• $-30 \leq$ nums[i] $\leq 30$
• The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.

Examples