LeetCode 238. Product of Array Except Self [Coding Interview Solution Explained]

In this video I explain the solution of a Facebook coding interview question “Product of Array Except Self” [LeetCode 238].
You can find it here -
leetcode.com/p...
This question is frequently asked in Amazon and Facebook software engineering interviews (according to LeetCode)
If there is a coding interview problem you would like me to cover, let me know in the comments.

[@willischiejina683]

Out of 5 explanations I've seen yours is the best, you explained the prefix/suffix part so clearly and in much shorter time than other videos. Thanks✅✅✅

[@ShiranAfergan]

Thanks! So glad it helped! 🎉

[@yeseniaodalyss3029]

omg. what an amazing explanation, AND under 9 minutes. very clear and concise. thank you for uploading.

[@ShiranAfergan]

You’re welcome! I’m glad you enjoyed it 😊

[@amanrubey]

Excellent Excellent Excellent! This is the first time when someone has explained something with this clearity and detail. It was fascinating to see the mysteries unfold. This is that 'Aha!' moment video

[@ShiranAfergan]

That’s awesome! I’m glad you found it :)

[@quantum598]

Best explanation i've seen (was able to implement in java! )

[@ShiranAfergan]

That’s awesome 💪🏽, I’m glad the video helped :)

[@quantum598]

@@ShiranAfergan Grateful to have found it! Question, not sure if you've seen LC 1010, but if you have, I am struggling with the intuition behind that :o

[@ShiranAfergan]

@@quantum598 I remember this question it’s a good one. I’ll see if I can make a good video on it :)

[@ObserverGuy]

omg that explaination is top notch, thanks

[@bisanal-ghoul3389]

Best explanation!! Ur channel is very underrated. Good job and please make more videos

[@ShiranAfergan]

Thank you!! Working on it :)

[@maheshnahak9510]

Great explanation, thanks! Would love to see more of your content, I have subscribed!

[@kapilvaishnav6851]

amazing explanation! please make full course. I with you have million of subscribers.

[@ShiranAfergan]

Thank you! 😄

[@PheezxCoding]

Great explanation! Thanks!

[@ShiranAfergan]

Thanks 😊 glad you liked it

[@AnuragPandey-ni1lo]

Great Explanation... Thanks :)

[@payalpatel6070]

Great work! Thank you.

[@ShiranAfergan]

You’re welcome! glad you liked it :)

[@mkehat1]

why didn't you calculate the entire product and then for each place divide it by its value int product = 1; for (int i = 0; i < size; i++) { product *= nums[i]; } for (int i = 0; i < size; i++){ out[i] = product / nums[i]; }

[@ShiranAfergan]

The problem description says you’re not allowed to use division :)

[@bocckoka]

also, it might overflow

[@asabs17]

מדהימה ורהוטה כבוד

[@ShiranAfergan]

תודה :)

[@bocckoka]

Why so many downvotes? This was quite good.

[@ShiranAfergan]

Thanks but where are you seeing any downvotes?

[@bocckoka]

@@ShiranAfergan There is a browser addon to make them visible, next to the like button, where they used to be.

[@ShiranAfergan]

Oh Cool. there is only one dislike though so maybe you’re seeing different numbers for some reason. Anyways I’m glad you liked the video :)

[@bocckoka]

@@ShiranAfergan

[@adityajagtap4349]

Why all this @shiran O(n) multiply all number .. O(n) divide total of multiplies with each number. Anything I'm missing here ?

[@adityajagtap4349]

ohh problem says .. not to use division operation .

[@ShiranAfergan]

Yes :)

[@RajatSingh-dg8ov]

Please make system Design vids! :)

[@mersadz3743]

Thank you Python.

[@ritwik121]

please can you make a video on leetcode.com/problems/shortest-subarray-with-sum-at-least-k/

[@DrGecko1]

Hey, why not multiply all of the values, keep it in a constant and then divide it by each element? Should be O(n)

[@ShiranAfergan]

Because the problem description says you can’t use the division operation :)

[@noseygirl8655]

I’m baffled that Google would ever reject you. What hope is there for the rest of us ?😫😂