↓ Skip to main content

35. Search Insert Position

8 June 2025·68 words·1 min· loading

Table of Contents

Table of Contents

IDEA
#

We can use Binary Search to solve the problem with $O(\log n)$ time complexity.

CODE
#

class Solution {
    public int searchInsert(int[] nums, int target) {
        int l = 0, r = nums.length - 1, mid = 0;
        
        while (l<=r){
            mid = (l+r) /2 ;

            if (nums[mid] < target){
                l  = mid + 1;
            }else{
                r = mid -1;
            }
        }

        return l;
        
    }
}