Product of Array Except Self

For each position, return the product of all other numbers, without using division. Division breaks on zeros, and the interviewer will usually ban it anyway.

Implement product_except_self(nums) in $O(n)$ time: compute the product of everything to the left of each position, then multiply by the product of everything to the right.