Given a sorted array of integers nums in ascending order and an integer target, return the index of target if it exists. If target is not present, return -1. Implement the solution using binary search.
Constraints
1 <= len(nums) <= 10^5
-10^9 <= nums[i], target <= 10^9
nums is sorted in strictly increasing order
Function Signature
defbinary_search(nums, target):
Interviewer
Your question is Binary Search in Sorted Array. Start with the requirements in the Question tab.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
