Solution: Search Insert Position
Understand how to apply modified binary search to return the index of a target or its correct insertion position in a sorted array. This lesson helps you master the algorithm’s two-pointer approach and gain insights into its time and space efficiency.
We'll cover the following...
We'll cover the following...
Statement
Given a sorted array of distinct integers, nums, and an integer, target, return the index of target if it exists in the array.
If the target is not present, return the index where it should be inserted to maintain the sorted order.
Your algorithm must run in the
Constraints:
nums.length...