solves sqrt in python

Author: anishLearnsToCode

README.md

@@ -2,7 +2,7 @@
 
 ![problems-solved](https://img.shields.io/badge/Problems%20Solved-107/571-1f425f.svg)
 ![problems-solved-java](https://img.shields.io/badge/Java-107/1571-1abc9c.svg)
-![problems-solved-python](https://img.shields.io/badge/Python-20/1571-1abc9c.svg)
+![problems-solved-python](https://img.shields.io/badge/Python-26/1571-1abc9c.svg)
 [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](CONTRIBUTING.md)
 
 ## Problems
@@ -24,7 +24,7 @@
 | 58 | [Length of Last Word](https://leetcode.com/problems/length-of-last-word) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/LengthOfLastWord.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/length_of_last_word.py) |
 | 66 | [Plus One](https://leetcode.com/problems/plus-one) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/PlusOne.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/plus_one.py) |
 | 67 | [Add Binary](https://leetcode.com/problems/add-binary) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/AddBinary.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/add_binary.py) |
-| 69 | [Sqrt(x)](https://leetcode.com/problems/sqrtx) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/Sqrtx.java) |
+| 69 | [Sqrt(x)](https://leetcode.com/problems/sqrtx) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/Sqrtx.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/sqrt.py) |
 | 70 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/ClimbingStairs.java) |
 | 83 | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/RemoveDuplicatesFromSortedList.java) |
 | 88 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/MergeSortedArray.java) |

python/sqrt.py

@@ -0,0 +1,32 @@
+def mySqrt(x: int) -> int:
+    left, right, ans = 0, x, 0
+    while left <= right:
+        middle = left + (right - left) // 2
+        result = middle ** 2
+        if result == x:
+            return middle
+        elif result > x:
+            right = middle - 1
+        else:
+            ans = middle
+            left = middle + 1
+    return ans
+
+
+# faster method, herons formula approach
+def heron_approximation(x: int) -> int:
+    if x is 0 or x is 1:
+        return x
+    guess = x / 2
+    epsilon = 10 ** -4
+    while True:
+        new_guess = 0.5 * (guess + x / guess)
+        if abs(guess - new_guess) < epsilon:
+            return int(guess)
+        guess = new_guess
+
+
+# print(mySqrt(int(8)))
+
+for i in range(50):
+    print(f'sqrt({i})={mySqrt(i)}')