LeetCode #7: Reverse Integer

preview_player
Показать описание
0:00 Intro
0:28 Overview of how bits work
2:12 Positive integer example
5:53 Negative integer example
8:13 Overflow example
9:27 Do we need to check the value of the last digit?

#programming #coding #algorithms
  1. Algo Engine
  2. programming
  3. coding
  4. leetcode
  5. algorithms
  6. chatgpt
Рекомендации по теме
Reverse Integer - 0:13:12

Reverse Integer - Bit Manipulation - Leetcode 7 - Python

Reverse Integer | 0:07:00

Reverse Integer | LeetCode problem 7

Reverse Integer | 0:12:16

Reverse Integer | Leetcode #7 | Modulo concept | Integer MAX_VALUE

Leetcode 7 Reverse 0:04:35

Leetcode 7 Reverse Integer

LeetCode Reverse Integer 0:06:20

LeetCode Reverse Integer Solution Explained - Java

LeetCode #7 - 0:05:35

LeetCode #7 - Reverse Integer

LeetCode #7: Reverse 0:11:06

LeetCode #7: Reverse Integer

Leetcode 7. Reverse 0:05:20

Leetcode 7. Reverse Integer (Java)

LeetCode Problem: 7. 0:10:27

LeetCode Problem: 7. Reverse Integer | Java Solution

Leetcode 7 - 0:08:09

Leetcode 7 - Reverse Integer (Java, Solution Explained)

LeetCode 7: Reverse 0:15:02

LeetCode 7: Reverse Integer - Interview Prep Ep 55

REVERSE INTEGER | 0:08:28

REVERSE INTEGER | LEETCODE 7 | PYTHON MATH SOLUTION

Reverse Integer Python 0:04:22

Reverse Integer Python Solution - LeetCode #7

Leetcode #7 Reverse 0:02:39

Leetcode #7 Reverse Integer

Reverse Integer - 0:05:27

Reverse Integer - leetcode 7

Reverse Integer - 0:03:36

Reverse Integer - LeetCode 7 - LeetCode Daily Challenge

Google Question | 0:14:39

Google Question | LeetCode 7. Reverse Integer | Interview Preparation | English | code io

Leetcode 7. Reverse 0:05:20

Leetcode 7. Reverse Integer in Python 3

LeetCode Explained - 0:07:05

LeetCode Explained - Reverse Integer [EASIEST WAY]

LeetCode | #7 0:16:00

LeetCode | #7 | Reverse Integer (Python)

LeetCode 7 - 0:04:25

LeetCode 7 - Reverse Integer

DSA Phir se 0:05:06

DSA Phir se with Sumeet | Leetcode 7 | Reverse Integer

Reverse Integer | 0:10:03

Reverse Integer | LeetCode 7 | Top Interview | Facebook Google Apple Amazon

Google Engineer Explains 0:25:57

Google Engineer Explains - LeetCode #7 - Reverse Integer - Solution (Python)

Комментарии
Автор

Hey! Great explanation.

But I had a solution which was a little easy for me to go with. Do you mind comparing and telling me which one is better in terms of everything?

## Reverse Integer

class Solution:
def reverse(self, x: int) -> int:

x = str(x)
if len(x) == 1:
return int(x)

sign = ''
if x[0] == '-':
sign = x[0]
x = x[1:]
rev_num = x[::-1]
final_answer = int(sign + rev_num)

if final_answer < -2**31 or final_answer > 2**31 - 1:
return 0
return final_answer

rsk_
Автор

why does it return 0 for -321 in leetcode

billionyears
Автор

Saw your solution on Leetcode and realized that your overflow checker is not good. It only checks if reverse > MAX_INT/10 or reverse*10 > MAX_INT but doesn't check if reverse*10 + digit might overflow before it's calculated. Essentially you should be using reverse > MAX_INT/10 - digit/10 as your checking expression.

kaustuvprateeq