Product of Array Except Self Problem

Product of Array Except Self Problem — ExecCode Easy DSA Practice

Solve the Product of Array Except Self problem on ExecCode. Free online easy DSA practice in Arrays - Logic Building. Write and run code in Java, C++, Python — no signup required to run.

Problem description

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]. The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer. You must write an algorithm that runs in O(n) time and without using the division operation.

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]. Input nums = [2, 3, 4]; Output [12, 8, 6]

Constraints

2 ≤ nums.length ≤ 10⁵ -30 ≤ nums[i] ≤ 30 Product of any prefix or suffix fits in a 32-bit integer

Practice Product of Array Except Self free on ExecCode. Browse DSA problems, topic map, and placement guides.