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. Example 1: Input: [1,3,5,6], 5 Output: 2 Example 2: Input: [1,3,5,6], 2 Output: 1 Example 3: Input: [1,3,5,6], 7 Output: 4 Example 4: Input: [1,3,5,6], 0 Output: 0 class Solution { public int searchInsert(int[] nums, int target) { int i = 0, length = nums.length; for(i=0;i<length;i++){ if(nums[i] >= target){ return i; } } return i; } } Try it on Leetcode Here, we are iterating each element in arrays. While iterating to find perfect insert position, if current number is greater than or equal to target then that position will be result and no need to iterate further. If no position are found and we are at end of array , then last position will b