Medium
Product of Array Except Self
Medium
121 submissions
25 coins
+100 XP
Array
Prefix Sum
Problem Description
Return an array `answer` where `answer[i]` is the product of every element of `nums` except `nums[i]`. Solve 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 <= nums.length <= 10^5`
- `-30 <= nums[i] <= 30`
- Every prefix/suffix product fits in a 32-bit integer.
Need help?
Connect with expert programmers for real-time collaborative coding, video meetings, and whiteboard sessions via CodeConnect.
Video Call
Whiteboard
Live Coding
Screen Share