Search⌘ K
AI Features

Problem: Product of Array Except Self

Understand how to return an array where each element is the product of all other elements except itself. Explore a two-pass O(n) solution using prefix and suffix products without division or extra space.

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