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 does not use division.
nums)Input:
[1,2,3,4]
Output: [24,12,8,6]
Input:
[-1,1,0,-3,3]
Output: [0,0,9,0,0]
Your program must print the result as a JSON array so it can be compared with the expected output.
No submissions yet.
Discuss prefix products, suffix products, and space optimization techniques.