Product Except Self

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].

30:00

medium

Topics

Companies

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].

Input: [1,2,3,4]

Output: [24,12,8,6]

$2 \leq \text{nums.length} \leq 10^5$
$-30 \leq \text{nums}[i] \leq 30$
The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.
Solution must run in $O(n)$ time and without using the division operation.

arr =[1,2,3,4]

Input Array (nums)

Current Phase:

PREFIX

Prefix Product:

1

Postfix Product:

1

Result Array

Variables

No variables to display

DepthFunction Call

1	productExceptSelf(nums=[4])

0/27