Product of Array Except Self

medium

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.

Test Cases

Copy an input into the main harness and Run to verify

Input

nums = [1,2,3,4]

Expected Output

[24,12,8,6]

Input

nums = [-1,1,0,-3,3]

Expected Output

[0,0,9,0,0]

Hint 1 — click to reveal

Can you precompute the product of everything to the LEFT of each index?

Hint 2 — click to reveal

Then do a right-to-left pass multiplying in the product of everything to the RIGHT.

Java Compiler