BINADD - Guideline to Upsolve after contest

Those who haven’t solved BINADD, Please watch this video once Add Two Numbers Without The "+" Sign (Bit Shifting Basics) - YouTube and try to upsolve now.

P.S : I watched this video understood the intent behind the XOR, AND in the algorithm given in the problem and came up with a solution that finds the number of iterations.

and TBH, This is the best video I came across to understand the given algorithm :slight_smile:

7 Likes

Thanks! Good video.

1 Like

Congratulations bro :heart_eyes: You are 5 stars now. I’m trying my best to catch you in DEC, BUT that’s really hard to me. Go ahead, I’m on your way :+1:

2 Likes

Congrats on 4* bro and yeah you will reach there in next contest hopefully. All the best :slight_smile:

2 Likes

Yeah, so somehow I was able to search for this exact video (this video found me actually:sweat_smile:) during the contest, and I was able to observe the inherent pattern after this.

1 Like

Thanks. It was useful.

1 Like

(Code in Java)
Facing a TLE in the 3rd subtask. Can u help me to resolve it?

1 Like

Link not correct ! :slight_smile: