Tap here to switch tabs
Problem
Submissions

Problem: Product of Array Except Self

Product of Array Except Self asks you to return an array where each position contains the product of every input value except the one at that position, in linear time without division.

Statement

You’re given an integer array, arr. Return a resultant array so that res[i] is equal to the product of all the elements of arr except arr[i].

Write an algorithm that runs in O(n)O(n) time without using the division operation.

Constraints:

  • 2≤2 \leq arr.length ≤103\leq 10^3
  • −30≤-30 \leq arr[i] ≤30\leq 30
  • The product of any prefix or suffix of arr is guaranteed to fit in a 32-bit integer.
⋮
Tap here to switch tabs
Problem
Submissions

Problem: Product of Array Except Self

Product of Array Except Self asks you to return an array where each position contains the product of every input value except the one at that position, in linear time without division.

Statement

You’re given an integer array, arr. Return a resultant array so that res[i] is equal to the product of all the elements of arr except arr[i].

Write an algorithm that runs in O(n)O(n) time without using the division operation.

Constraints:

  • 2≤2 \leq arr.length ≤103\leq 10^3
  • −30≤-30 \leq arr[i] ≤30\leq 30
  • The product of any prefix or suffix of arr is guaranteed to fit in a 32-bit integer.