Scribd
Upload
17 views1 page

D1-P5-Product of Array Except Self

The document describes the LeetCode problem 'Product of Array Except Self', which requires returning an array where each element is the product of all other elements in the input array without using division. The solution must run in O(n) time and adhere to specific constraints on the input array. Examples and constraints are provided to illustrate the problem requirements.

Uploaded by

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

D1-P5-Product of Array Except Self

The document describes the LeetCode problem 'Product of Array Except Self', which requires returning an array where each element is the product of all other elements in the input array without using division. The solution must run in O(n) time and adhere to specific constraints on the input array. Examples and constraints are provided to illustrate the problem requirements.

Uploaded by

Prathmesh Kokare
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

09/12/2024, 13:04 Product of Array Except Self - LeetCode

Problem List Run Submit

Description Editorial Solutions Submissions

238. Product of Array Except Self


Medium Topics Companies Hint

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

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]

Constraints:

2 <= nums.length <= 105

-30 <= nums[i] <= 30

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

Follow up: Can you solve the problem in O(1) extra space complexity? (The output array does not count as extra space for space compl

23.3K 368

https://leetcode.com/problems/product-of-array-except-self/description/ 1/1

You might also like