Skip to main content

6. Search Insert Position

easyAsked at Electronic Arts

Binary-search for a target or the index where it would be inserted to keep the array sorted.

By Alex Chen, Founder, InterviewChamp.AI · Last verified

Problem

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 inserted to maintain sorted order.

Constraints

  • 1 <= nums.length <= 10^4
  • -10^4 <= nums[i], target <= 10^4
  • nums has no duplicates and is sorted ascending

Examples

Example 1

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

Example 2

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

Approaches

1. Linear scan

Walk until you find the target or a larger value.

Time
O(n)
Space
O(1)
for(let i=0;i<nums.length;i++)
  if(nums[i]>=target) return i;
return nums.length;

Tradeoff:

2. Binary search

Maintain lo and hi; when the loop exits, lo is the insert position.

Time
O(log n)
Space
O(1)
function searchInsert(nums, target) {
  let lo = 0, hi = nums.length;
  while (lo < hi) {
    const mid = (lo + hi) >>> 1;
    if (nums[mid] < target) lo = mid + 1;
    else hi = mid;
  }
  return lo;
}

Tradeoff:

Electronic Arts-specific tips

EA loves seeing the half-open interval invariant verbalized — it shows the candidate can reason about leaderboard scan boundaries without off-by-one bugs.

Solve it now

Free. No sign-up. Python and JavaScript run instantly in your browser.

Output

Press Run or Cmd+Enter to execute

Practice these live with InterviewChamp.AI

Drill Search Insert Position and other Electronic Arts interview questions under real-loop conditions with instant feedback on your reasoning, complexity claims, and code.

Practice these live with InterviewChamp.AI →