Binary Search · Coding Interview Practice

Binary SearchGiven a sorted array of integers and a target value, return the index of the target if it is found. If not, return -1.Constraints

1 <= nums.length <= 10^4

-10^9 <= nums[i], target <= 10^9

All integers in nums are unique

nums is sorted in ascending order

Examples

Input: nums = [-1,0,3,5,9,12], target = 9 Output: 4

Input: nums = [-1,0,3,5,9,12], target = 13 Output: -1

LetsDiscuss

Loading your session…