Hello coders, If you are looking for the solution to the Search Insert Position of the Leetcode problem. Then you’ve reached the right place.

Today, In this blog I will give a java solution for this problem. But before that let’s see the problem statement.

**Problem Statement:**

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 if it were inserted in order.

You must write an algorithm with `O(log n)`

runtime complexity.

**Example 1:**

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

**Example 2:**

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

**Example 3:**

Input:nums = [1,3,5,6], target = 7Output:4

**Constraints:**

`1 <= nums.length <= 10`

^{4}`-10`

^{4}<= nums[i] <= 10^{4}`nums`

contains**distinct**values sorted in**ascending**order.`-10`

^{4}<= target <= 10^{4}

## Search Insert Position Leetcode Solution in Java

//Search Insert Position Leetcode Solution class Solution { public int searchInsert(int[] nums, int target) { int low=0; int high=nums.length-1; if(nums.length < 1) return 0; while(low<=high){ int mid=low+(high-low)/2; if(target==nums[mid]){ return mid; } else if(target<nums[mid]){ high=mid-1; } else{ low=mid+1; } } return low; } } //Search Insert Position Leetcode Solution

**Disclaimer:** This problem(**Search Insert Leetcode solution**) is originally created by Leetcode. Codesagar only provides a solution for it. This solution is only for Educational and learning purposes.