Product of Array Except Self

Given an integer list nums, return a list answer where answer[i] is the product of every element except nums[i].

Do it in O(n) time without using division.

Example 1

Input: nums = [1, 2, 3, 4]
Output: [24, 12, 8, 6]

Example 2

Input: nums = [-1, 1, 0, -3, 3]
Output: [0, 0, 9, 0, 0]

Example 3

Input: nums = [2, 3]
Output: [3, 2]

Constraints

• 2 ≤ len(nums) ≤ 2 · 10^5
• -30 ≤ nums[i] ≤ 30
• Follow-up: use O(1) extra space besides the output