Leetcode 7 - Bit Manipulation | Reverse Integer

Topic: Bit Manipulation *Note* - Please see pinned comment for slight clarification!

Code:

Leetcode:

*Note* I claim no rights to this question. All rights belong to Leetcode. If I'm reviewing a solution that was from another Leetcode user or Leetcode itself I will give credit below.

[pawanbishnoi]

t == 7
return 0;

What if t is 8 or 9?

[rebertliu]

Come from leetcode, and thanks for explanation.

[shimanopower]

Cool video. Subscribed. Only suggestion is black marker to increase contrast. And maybe thicker marker to further increase readability on mobile

[DevendraLattu]

Correction: t > 7 for Integer.MAX_VALUE and t < -8 for Integer.MIN_VALUE in the checks.

[algoseekee]

Thanks for the video, man! Where are bits manipulations here? 🤔

[xinting_study]

Thank you so much for your video. 
I am just still confused that why we need to consider (res>int.max/10) || (res==int.max/10 && t >7) seperately, why not:
if res > (int.max - t) / 10?
❤️Thanks again! Your video is good!!

[TomarSahabVlogs]

Next time after the code do a dry run with an example will be better for new ones in Algorithm world

[JohnnyFive]

Nice job, but few mistakes. -2^31 should be -2147483648, not 2147483648 (you forgot the negative). And the variable "res" should be called "rev", ya know, like reverse (the name of the function). Also, go slower and explain the steps more clearly. I understood, but would get more out of it if you elaborate on each step, especially for very new beginners. Good luck man!