Search⌘ K
AI Features

Problem: Product of Array Except Self

Explore how to solve the problem of finding the product of all array elements except the current one without using division. Understand the efficient two-pass approach using prefix and suffix products to achieve O(n) time complexity and constant extra space, enhancing your array manipulation skills.

Statement

Given an integer array nums, return an array answer where answer[i] represents the product of all elements in nums except nums[i].

You must design an algorithm that operates in O(n)O(n) time complexity and does not use the division operation.

Note: The product of any prefix or suffix of nums is guaranteed to fit in a 3232-bit integer.

Constraints:

  • 22 \leq nums.length 105\leq 10^5 ...