Coding Interview Question - Bit Manipulation - Divide Integers

[@mohammadyahya78]

Wow. The best on the platform

[@deependrasinghshekhawat8107]

Thank You ma'am, great explanation!

[@SCALER]

Thanks! Glad this was helpful! 😃

[@levi-lb6dp]

Thankyou so much ❣️❣️

[@Utkarsh.Raj.129]

Very good explanation

[@kanhaiyakumar2685]

I think naive approach time complexity should be O(dividend/divisor). bit-manipulation explanation is really very good.

[@SCALER]

Hey Kanhaiya, for naive approach it will be O(dividend/divisor). The final/actual time complexity it will be O(dividend). :)

[@rahulsaxena8204]

For anyone who is not clear on how q(quotient) is being updated: Think of updation of q as constructing q, by setting the bits of q. When the (temp + (divisor

[@illusionEditorss]

thnx buddy !

[@rishabhdevbanshi9780]

will it be faster than doing normal q += (1LL

[@parassetia4964]

what was the significance of 1ll while updating q..am still stuck at that first

[@vinayak186f3]

3 AM , just noticed the time 🙌

[@whynesspower]

class Solution { public: long long divide(long long dividend, long long divisor) { long long n=dividend, m=divisor; int sign= n

[@amartyachoudhary6793]

On leetcode the question asks to use only 32 bit signed int. There this method will not work, will have to use bit manipulation in a different way.

[@dragonforce2244]

Exactly! This code will cause overflow/Runtime error

[@harshalgarg1149]

Thanks.

[@chaitanyarao6045]

Thanks for such a clear and crisp explanation.

[@tonyriddle7646]

What is q here equal to???

[@satyamsavita1347]

@@tonyriddle7646 quotient

[@siddharthkshirsagar2545]

thanks for this I was stuck on this problem for so long. Amazing Video

[@gunahawk6893]

damn great explanation

[@akshaygodase8067]

Thanks a lot for this explanation. You saved me.

[@RahulKashyap-yv5ox]

excellent explanation

[@rishabhgupta1282]

Loved the video brillant

[@girikgarg1268]

Will the O(dividend) solution get accepted or will it give TLE due to the constraints?

[@ankuradhey]

Very well explained. Just the quotient statement is not clearly visible and not clear after watching again too.

[@rohitgarg4065]

The first approach will not work for negative numbers.

[@JMROMERO95]

It will if you use the absolute values.

[@demoilus]

She is confused.

[@noharashin6369]

So i'll come out and say it. your voice is mesmerizing

[@sonyanbu8490]

Why using long long when it is integer division?

[@jaisinha1378]

Bcz of the overflow situation

[@PeaceLoveAman]

8:17 paridhi rocks, scaler academy and watchers shoks.

[@AyushiSharmaDSA]

best explanation.. Thanks for the video :)

[@TheAjit1111]

Good explanation. first time I come to know that m

[@shahperzia1121]

q|1L

[@PulkitMalhotra]

why you take long long ?

[@tirthjayswal9895]

Very Good

[@varunnarayanan8720]

@4.11 I understood the concept . Nice explanation.

[@sakshijain9674]

Thanks..well explained.

[@AWSFan]

Updation Of `q` and `t` was unclear to me...Can Someone Explain?

[@rahulsaxena8204]

For anyone who is not clear on how q(quotient) is being updated: Think of updation of q as constructing q, by setting the bits of q. When the (temp + (divisor

[@vishaljain6233]

Need to work on your explanation skills. Some of the terms you use while explaining are wrong like when the if condition becomes false we don't come out of the loop instead you should say that we don't execute the conditional statements and go to the next iterations.

[@yv6358]

you should charge your laptop

[@prateekkumar7054]

Poor Explanation

[@yv6358]

tere ko kahin samajh nahin ayega

[@tarunponnam8851]

Very good explanation

[@SCALER]

Happy to hear that! 🙌🏼