Binary Search Insertion Index | Dataford Interview Questions

How would you modify binary search to return the position where a target should be inserted if it is not present in the array?

Implement search_insert(nums, target), returning the first index whose value is greater than or equal to target, while preserving sorted order. nums is a sorted list of integers and may be empty; return an integer in the range 0 through len(nums).

Constraints

0 <= nums.length <= 10^4
-10^9 <= nums[i], target <= 10^9
nums is sorted in nondecreasing order
Return an index from 0 through nums.length

Function Signature

def search_insert(nums, target):

Your question is Binary Search Insertion Index. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

How would you modify binary search to return the position where a target should be inserted if it is not present in the array?

Constraints

0 <= nums.length <= 10^4
-10^9 <= nums[i], target <= 10^9
nums is sorted in nondecreasing order
Return an index from 0 through nums.length

Function Signature

def search_insert(nums, target):

Your question is Binary Search Insertion Index. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.