dsa · medium
Product of Array Except Self
ArrayPrefix Sum
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]. You must write an algorithm that runs in O(n) time and without using the division operation.
Arguments
nums— the input array of integers
**Example 1:** `` Input: nums = [1,2,3,4] Output: [24,12,8,6] ``
Constraints
2 <= nums.length <= 10^5 Hidden tests include near-max size for this bound; a slower-than-intended solution TLEs.
Examples
Example 1
Input: [1,2,3,4] Expected: [24,12,8,6]
Example 2
Input: [-1,1,0,-3,3] Expected: [0,0,9,0,0]