Search Insert Position
Problem 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. Example 1: Example 2: Example 3: Example 4: Example 5: Constraints: 1 <= nums.length <= 104 -104 <= numsi <= 10…