# LeetCode: Search Insert Position Solution

*Understand why returns "low/left"*

## Approach

Goal of this problem is understanding classic binary search pattern in a different way: why returns low/left?

## Implementation

1/**2 * @param {number[]} nums3 * @param {number} target4 * @return {number}5 */6var searchInsert = function (nums, target) {7 let N = nums.length8 let left = 09 let right = N - 110 let res = null1112 while (left <= right) {13 let mid = Math.floor((left + right) / 2)14 if (nums[mid] > target) {15 right = mid - 116 } else if (nums[mid] < target) {17 left = mid + 118 } else {19 res = mid20 break21 }22 }2324 return res !== null ? res : left25}

## Comments

Loading comments...

## Tags

leetcode

array

binary search

## Apply and earn a $2,500 bonus once you're hired on your first job!

Clients from the Fortune 500 to Silicon Valley startups

Choose your own rate, get paid on time

From hourly, part-time, to full-time positions

Flexible remote working environment

A lot of open JavaScript jobs!!

**Fact corner:** Referred talent are 5x more likely to pass the Toptal screening process than the average applicant.

**Still hesitate?** Read HoningJS author's guide on dealing with Toptal interview process.