#35 Search Insert Position

Easy Acceptance 0%

description

Problem Description

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. You must write an algorithm with `O(log n)` runtime complexity.

checklist Constraints

1 <= nums.length <= 10^4
-10^4 <= nums[i] <= 10^4
nums contains distinct values sorted in ascending order.
-10^4 <= target <= 10^4

science Examples

Case #1

In: nums = [1,3,5,6] target = 5

Out: 2

Case #2

In: nums = [1,3,5,6] target = 2

Out: 1

Mastery Tags

Arrays Binary Search

Hiring Companies

Amazon Apple Bloomberg

code