daily question added

Author: shushrutsharma

.gitignore

@@ -2,4 +2,5 @@
 __pycache__/
 .DS_Store
 14. Questions/code.py
-14. Questions/temp.py
+14. Questions/temp.py
+14. Questions/tempCodeRunnerFile.py

14. Questions/leetcode 35 - search insert position.py

@@ -0,0 +1,28 @@
+"""
+
+Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
+
+You must write an algorithm with O(log n) runtime complexity.
+
+Question: https://leetcode.com/problems/search-insert-position/
+
+"""
+
+class Solution:
+    def searchInsert(self, nums: List[int], target: int) -> int:
+        l = 0
+        r = len(nums)-1
+        
+        while l <= r:
+            mid = (l+r)//2
+            
+            if target == nums[mid]:
+                return mid
+            
+            if target > nums[mid]:
+                l = mid +1
+                
+            else:
+                r = mid - 1
+                
+        return l