Search Insert Position

Google Interview Question

Problem Overview

Difficulty: Easy
LeetCode Pattern: Binary Search

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.

Note: You must write an algorithm with O(log n) runtime complexity.

Input:
· nums = [1,3,5,6]
· target = 5
Output:
· 2

…