Added 67 & 69

RioSec · RioSec · commit 81d78229774f · 2024-05-29T15:35:44.000-05:00
diff --git a/Python3/67-Add_Binary.py b/Python3/67-Add_Binary.py
@@ -0,0 +1,25 @@
+class Solution:
+    def addBinary(self, a: str, b: str) -> str:
+        max_len = max(len(a), len(b))
+
+        a = a.zfill(max_len)
+        b = b.zfill(max_len)
+
+        # Initialize the result
+        result = ''
+
+        # Initialize the carry
+        carry = 0
+
+        # Traverse the string
+        for i in range(max_len -1, -1, -1):
+            r = carry
+            r += 1 if a[i] == '1' else 0
+            r += 1 if b[i] == '1' else 0
+            result = ('1' if r % 2 == 1 else '0') + result
+            carry = 0 if r < 2 else 1 # Complete the carry
+
+        if carry !=0 : result = '1' + result
+
+        return result.zfill(max_len)
+
diff --git a/Python3/69-Sqrt.py b/Python3/69-Sqrt.py
@@ -0,0 +1,13 @@
+class Solution:
+    def mySqrt(self, x: int) -> int:
+        # Start by assuming b is equal to x
+        b = x
+
+        # Use the Newton-Raphson formula to improve the estimate iteratively
+        while b * b > x:
+
+            # Continue the iteration until (b \times b) is less than or equal to x, meaning that b is the largest integer whose square is less than or equal to x
+            b = (b + x // b) // 2
+
+        # After the loop, return b as the integer part of the square root
+        return b
