Zero To DSAZero To DSA
Privacy Policy路FAQ路Report a Bug路Support on Ko鈥慺i
Best Time to Buy and Sell StockLongest Substring Without Repeating Characters

Product of Array Except Self

medium
Time: O(n)
Space: O(1)

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]. You must solve it without division and in O(n) time.

Constraints

  • 2 <= nums.length <= 10^5
  • -30 <= nums[i] <= 30

Examples

Input: nums = [1,2,3,4]
Output: [24,12,8,6]
Input: nums = [-1,1,0,-3,3]
Output: [0,0,9,0,0]