Search Insert Position
Return the index where target should be inserted in sorted order.
Examples
Input: [[1,3,5,6],5]
Output: 2
Input: [[1,3,5,6],2]
Output: 1
Hints
Initialize `left` to 0 and `right` to `len(nums) - 1` to define the search range.
If `target` is greater than the last element in `nums`, return `len(nums)` as the insertion index.
Modify the binary search to return the first index where `nums[index] >= target` (lower bound) even if `target` is not present in the array.
Search Insert Position
Return the index where target should be inserted in sorted order.