Binary Search
Easy
Binary Search
Given a sorted array of distinct integers and a target, print the index of target, or -1 if it is not present. The solution must run in O(log n).
Constraints
1 <= n <= 10^4 -10^4 < nums[i], target < 10^4
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.