Divide Two Integers | Leetcode 29 | Live coding session

preview_player
Показать описание

1) 0:00 Explaining the problem out loud
2) 1:10 Algorithm walkthrough
3) 9:15 Coding it up

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

Although you did not use bit operations, your explanation is the clearest on why we need two while loops. The example visual is very helpful. I've watched a bunch. They spent quite some time explaining bit manipulation but kind of glossed over why the two while loops. Thank you for sharing your perspective!

ax
Автор

Thank lord!! After going through shit ton vids, I finally found yours that makes the most sense to me. Thank bruh :)

sehejwahla
Автор

Great explanation, watch it till the last for better understanding.

pavniujla
Автор

Your Approach is good but as per the question statement "divide two integers without using multiplication, division, and mod operator.". so, instead of using 2*sum, we can use sum+sum, similarly, 2*count -> count+count. this way I think we can remove the usage of multiplication. but I am not sure whether it is a good way or not.

omnamahshivaya
Автор

You should have included a card in the video while your were going in the wrong way.

AmazingWorld-fwoc