Product of Array Except Self
MediumP1Coding
Given an integer array nums, return an array answer where answer[i] is the product of every element of nums except nums[i].
Do not use division. Aim for O(n) time. Every prefix and suffix product fits in a 32-bit integer.
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 <= nums.length <= 10^5
- -30 <= nums[i] <= 30
- Every prefix and suffix product fits in a 32-bit integer.
Hints
Give it a real attempt first. Run shows which examples fail.
Saved automatically
Run checks the 3 visible tests, Submit all 8. ⌘Enter runs, ⌘⇧Enter submits.