done with binary search tasks

Author: Toluwalase

leetcode/binary-search/arranging-coins/toluwalase.py

@@ -0,0 +1,8 @@
+class Solution:
+    def arrangeCoins(self, n: int) -> int:
+        count = 0
+        while count < n:
+            count += 1
+            n = n - count
+        return count
+        

leetcode/binary-search/search-insert-position/toluwalase.py

@@ -0,0 +1,13 @@
+class Solution:
+    def searchInsert(self, nums: List[int], target: int) -> int:
+        first = 0
+        last = len(nums) - 1
+        while first <= last:
+            midpoint = (first+last)//2
+            if nums[midpoint] == target:
+                return midpoint
+            elif nums[midpoint] < target:
+                first = midpoint + 1
+            else:
+                last = midpoint - 1
+        return first