diff --git a/submissions/Himanshu-Maurya/Add-Binary/screenshot1.png b/submissions/Himanshu-Maurya/Add-Binary/screenshot1.png new file mode 100644 index 0000000..97672e3 Binary files /dev/null and b/submissions/Himanshu-Maurya/Add-Binary/screenshot1.png differ diff --git a/submissions/Himanshu-Maurya/Add-Binary/screenshot2.png b/submissions/Himanshu-Maurya/Add-Binary/screenshot2.png new file mode 100644 index 0000000..cd4bb26 Binary files /dev/null and b/submissions/Himanshu-Maurya/Add-Binary/screenshot2.png differ diff --git a/submissions/Himanshu-Maurya/Add-Binary/solution.py b/submissions/Himanshu-Maurya/Add-Binary/solution.py new file mode 100644 index 0000000..5678fae --- /dev/null +++ b/submissions/Himanshu-Maurya/Add-Binary/solution.py @@ -0,0 +1,19 @@ +class Solution: + def addBinary(self, a: str, b: str) -> str: + result = [] + i, j = len(a) - 1, len(b) - 1 + carry = 0 + + while i >= 0 or j >= 0 or carry: + bit1 = int(a[i]) if i >= 0 else 0 + bit2 = int(b[j]) if j >= 0 else 0 + + total = bit1 + bit2 + carry + carry = total // 2 + result.append(str(total % 2)) + + i -= 1 + j -= 1 + + return ''.join(reversed(result)) + diff --git a/submissions/Himanshu-Maurya/reverse-integer/Screenshot 2.png b/submissions/Himanshu-Maurya/reverse-integer/Screenshot 2.png new file mode 100644 index 0000000..234dcf1 Binary files /dev/null and b/submissions/Himanshu-Maurya/reverse-integer/Screenshot 2.png differ diff --git a/submissions/Himanshu-Maurya/reverse-integer/Screenshot 3.png b/submissions/Himanshu-Maurya/reverse-integer/Screenshot 3.png new file mode 100644 index 0000000..2aadc4f Binary files /dev/null and b/submissions/Himanshu-Maurya/reverse-integer/Screenshot 3.png differ diff --git a/submissions/Himanshu-Maurya/reverse-integer/screenshot1.png b/submissions/Himanshu-Maurya/reverse-integer/screenshot1.png new file mode 100644 index 0000000..d0448e9 Binary files /dev/null and b/submissions/Himanshu-Maurya/reverse-integer/screenshot1.png differ diff --git a/submissions/Himanshu-Maurya/reverse-integer/solution.py b/submissions/Himanshu-Maurya/reverse-integer/solution.py new file mode 100644 index 0000000..8cf7678 --- /dev/null +++ b/submissions/Himanshu-Maurya/reverse-integer/solution.py @@ -0,0 +1,13 @@ +class Solution: + def reverse(self, x: int) -> int: + MIN_INT, MAX_INT = -2**31, 2**31 - 1 + + sign = -1 if x < 0 else 1 + x = abs(x) + + reversed_num = sign * int(str(x)[::-1]) + + if reversed_num < MIN_INT or reversed_num > MAX_INT: + return 0 + return reversed_num +