Counter Game || Bit Manipulation || HackerRank

Problem:www.hackerrank.com/challenges...
Solution:github.com/jatin-verma-1999/C...

[@ritwikgarg]

Thank you! very helpful

[@anurudhsingh3397]

great explanation
now i can write code from myself...

[@shubhamchaudhary4225]

Great work Jatin Da

[@FaisalKhan-ce2qu]

great video for a beginner like me ! thank you!

[@jatinverma3378]

Thanks

[@Vineetkumar-qz4wj]

Thanks sir ji👍

[@YashKrishan99]

Pehli video se bohot paisa aaya....use n throw waale Ball pen se seedha trimax 😍

[@shubhamchaudhary4225]

🤣🤣🤣🤣🤣

[@jatinverma3378]

😂😂

[@vipul5529]

Ameer toh bhai pehle se hi h

[@Vineetkumar-qz4wj]

😂

[@vipul5529]

Bas kbhi kbhi thoda kanjoosi dikha deta h😂😂

[@anjandey6089]

in else block count=log2(n); what does it significes???/

[@jatinverma3378]

Count stores the number of bits required to release the number n.

[@vipul5529]

Arre kya baat h

[@chrismdavis2009]

Hello Jatin, I like the idea of your solution, but I think I find a logical issue with it.
It works for the example of 132, but if we take another example, say n = 220(not a power of 2).
if we take the log(n) as an int, we get 2(since the decimal is cut off).
next, if we left shift 1 twice (1

[@jatinverma3378]

If you take n=220, log(n) would be 7.
Then n would be 220-128 = 92.

[@jatinverma3378]

If you are confused about how log(n) is giving us a number of bits then you should Google it. It is simple you will understand it easily.

[@chrismdavis2009]

@@jatinverma3378 My apologies Jatin, I realized my calculation for log was base 10, not 2. I am getting the right answer, thank you and well done!

[@Vineetkumar-qz4wj]

What is p in this code plz explain

[@jatinverma3378]

P is your number which is smaller than n and also a power of 2

[@nickzesto6175]

What about time complexity? Atleast you would have submitted and checked.

[@jatinverma3378]

If you see the code every time I am changing n to n/2 hence complexity is O(logn base 2).