first bad version

Author: anishLearnsToCode

README.md

@@ -84,7 +84,7 @@
 | 268 | [Missing Number](https://leetcode.com/problems/missing-number) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/MissingNumber.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/missing_number.py) |
 | 270 | 🔒 [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value) | Easy | |
 | 276 | 🔒 [Paint Fence](https://leetcode.com/problems/paint-fence) | Easy | |
-| 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/FirstBadVersion.java) |
+| 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/FirstBadVersion.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/first_bad_version.py)|
 | 283 | [Move Zeroes](https://leetcode.com/problems/move-zeroes) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/MoveZeros.java) |
 | 290 | [Word Pattern](https://leetcode.com/problems/word-pattern) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/WordPattern.java) |
 | 292 | [Nim Game](https://leetcode.com/problems/nim-game) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/NimGame.java) |

python/first_bad_version.py

@@ -0,0 +1,21 @@
+# The isBadVersion API is already defined for you.
+# @param version, an integer
+# @return an integer
+def isBadVersion(version):
+    return None
+
+
+class Solution:
+    def firstBadVersion(self, n: int) -> int:
+        """
+        :type n: int
+        :rtype: int
+        """
+        left, right = 0, n
+        while left <= right:
+            middle = left + (right - left) // 2
+            if isBadVersion(middle):
+                right = middle - 1
+            else:
+                left = middle + 1
+        return left