Product of Array Except Self

Try to solve the Product of Array Except Self problem.


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.


  • 22 \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.


Level up your interview prep. Join Educative to access 70+ hands-on prep courses.