Binary Search in Sorted Array

Problem

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