solves Valid perfect square

Author: anishLearnsToCode

README.md

@@ -100,7 +100,7 @@
 | 349 | [Intersection of 2 Arrays](https://leetcode.com/problems/intersection-of-two-arrays) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/IntersectionOfTwoArrays.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/intersection_of_2_array.py) |
 | 350 | [Intersection of 2 Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/IntersectionOfTwoArraysII.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/intersection_of_2_arrays_II.py) |
 | 359 | 🔒 [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter) | Easy | |
-| 367 | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/IsPerfectSquare.java) |
+| 367 | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/IsPerfectSquare.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/valid_perfect_square.py) |
 | 374 | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/GuessNumberHigherOrLower.java) |
 | 383 | [Ransom Note](https://leetcode.com/problems/ransom-note) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/RansomNote.java) |
 | 387 | [First Unique Character in String](https://leetcode.com/problems/first-unique-character-in-a-string) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/FirstUniqueCharacter.java) |

python/valid_perfect_square.py

@@ -0,0 +1,24 @@
+class Solution:
+    # binary search method
+    def isPerfectSquare(self, number: int) -> bool:
+        if number == 1:
+            return True
+        left, right = 0, number // 2
+        while left <= right:
+            middle = (left + right) // 2
+            mid_square = middle * middle
+            if mid_square == number:
+                return True
+            elif mid_square < number:
+                left = middle + 1
+            else:
+                right = middle - 1
+        return False
+
+    # Newton's Method
+    # def isPerfectSquare(self, number: int) -> bool:
+    #     r = number
+    #     while r * r > number:
+    #         r = (r + number / r) // 2
+    #     return r * r == number
+