// Product of Array Except Self — MEDIUM

// Category: array

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

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

Hint: Build a prefix-products array left to right, then multiply with suffix products right to left in a single pass.

Example: nums = [1, 2, 3, 4]

Output: [24, 12, 8, 6]