Skip to content

problem3.md

Latest commit

 

History

History
15 lines (12 loc) · 495 Bytes

problem3.md

File metadata and controls

15 lines (12 loc) · 495 Bytes

Problem 3: Insertion Point Prediction

Problem Statement

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.

Input Format

  • A sorted array nums.
  • An integer target.

Example

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