Scribd
Upload
53 views1 page

Product of Array Except Itself

The document describes a problem to return an array where each element is the product of all other elements in the input array except itself. The product of any prefix or suffix of the input array will fit in a 32-bit integer. An algorithm is required that solves this problem in O(n) time complexity without using division.

Uploaded by

Hari Pedapati
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
53 views1 page

Product of Array Except Itself

The document describes a problem to return an array where each element is the product of all other elements in the input array except itself. The product of any prefix or suffix of the input array will fit in a 32-bit integer. An algorithm is required that solves this problem in O(n) time complexity without using division.

Uploaded by

Hari Pedapati
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd

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.

Example 1:

Input: nums = [1,2,3,4]


Output: [24,12,8,6]
Example 2:

Input: nums = [-1,1,0,-3,3]


Output: [0,0,9,0,0]

Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums e

You might also like