Skip to main content

6. Search Insert Position

easyAsked at Squarespace

Find the index where a target should be inserted into a sorted array; Squarespace uses it to test bounded binary-search.

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

Problem

Given a sorted array of distinct integers and a target, return the index if found; otherwise return the index where it would be inserted.

Constraints

  • 1 <= nums.length <= 10^4
  • Sorted ascending, distinct values

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 forward until you find an index >= target.

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

Lower-bound search collapses on insertion index.

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:

Squarespace-specific tips

Squarespace expects you to use `>>> 1` for unsigned mid and to mention how lower-bound search drives ordered insertion of new page sections in their site editor.

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 Squarespace interview questions under real-loop conditions with instant feedback on your reasoning, complexity claims, and code.

Practice these live with InterviewChamp.AI →