Search Insert Position Problem

Search Insert Position Problem — ExecCode Easy DSA Practice

Solve the Search Insert Position problem on ExecCode. Free online easy DSA practice in Binary Search. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Given a sorted array of distinct integers nums and a target value, return the index if the target is found. If not, return the index where it would be inserted in order to keep nums sorted in ascending order. You must write an algorithm with O(log n) runtime complexity.

Examples

Input nums = [1, 3, 5, 6, 7, 9, 11], target = 2; Output 1. Input nums = [1, 3, 5, 6], target = 5; Output 2. Input nums = [1, 3, 5, 6], target = 7; Output 4

Constraints

1 ≤ nums.length ≤ 10⁴ -10⁴ ≤ nums[i] ≤ 10⁴ nums contains distinct values sorted in ascending order -10⁴ ≤ target ≤ 10⁴

Practice Search Insert Position free on ExecCode. Browse DSA problems, topic map, and placement guides.