LeetCode 35. Search Insert Position



Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You may assume no duplicates in the array.

Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0


To do a search in a sorted array, we can consider using binary search to achieve. Just by following basic binary search principle, to compare mid position value with target value constantly and we can find the target or the right place to insert the target.

Video Tutorial

Java Solution

4 Thoughts to “LeetCode 35. Search Insert Position”

  1. Hi GoodTecher,
    You are doing a nice work on helping me to improve my problem-solving skill.
    Here is one LeetCode that I need you to explain – LeetCode 278 First Bad Version.

Leave a Reply

Your email address will not be published. Required fields are marked *