LeetCode 238. Product of Array Except Self [Algorithm + Code Explained ]

preview_player
Показать описание
One of the most frequently asked coding interview questions on Array in companies like Google, Facebook, Amazon, LinkedIn, Microsoft, Uber, Apple, Adobe etc.

LeetCode : Product of Array Except Self

Question : Given an array nums of n integers where n greater than 1, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].

Example:

Input: [1,2,3,4]

Output: [24,12,8,6]

Constraint: It's guaranteed that the product of the elements of any prefix or suffix of the array (including the whole array) fits in a 32 bit integer.

Note: Please solve it without division and in O(n).

Follow up:
Could you solve it with constant space complexity? (The output array does not count as extra space for the purpose of space complexity analysis.)

Рекомендации по теме
Комментарии
Автор

The cheat sheet at 1:37 is what is an underrated and a brilliant take away. May I ask where’d you get it from ? Or is it your compilation ?

shahezadvirani
Автор

Do you have a google doc or something with these cheat sheets ?

rockyisabroad
Автор

Thank you maam for the great explaination. Need more such videos for the problems on LeetCode 😊

dhruvilsoni
Автор

Why Space complexity is O(1)? It is O(n) as you use one extra array.

prayagbhatt