Problem: Search Insert Position

15 min

Understand how to solve the search insert position problem by applying a modified binary search that efficiently finds the correct index or insertion point for a target in a sorted array. This lesson helps you grasp the algorithm's logic, implement it in code, and ensures the solution runs in logarithmic time.

Statement

Given a sorted array of distinct integers, nums, and an integer, target, return the index of target if it exists in the array.
If the target is not present, return the index where it should be inserted to maintain the sorted order.

Your algorithm must run in the $O(\log n)$ time.

Constraints:

$1 \leq$ nums.length $\leq 10^3$
$-10^4 \leq$ nums[i] $\leq 10^4$
nums contains distinct values sorted in ascending order.
$-10^4 \leq$ target $\leq 10^4$

Problem: Search Insert Position

15 min

Statement

Your algorithm must run in the $O(\log n)$ time.

Constraints:

$1 \leq$ nums.length $\leq 10^3$
$-10^4 \leq$ nums[i] $\leq 10^4$
nums contains distinct values sorted in ascending order.
$-10^4 \leq$ target $\leq 10^4$

Problem: Search Insert Position

Statement

Examples

Understand the problem

Figure it out!

Try it yourself

Problem: Search Insert Position

Statement

Examples

Understand the problem

Figure it out!

Try it yourself