Binary Search in Sorted Array

EasyPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Binary Search in Sorted Array. Start with the requirements on the right.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.

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

Function Signature

def binary_search(nums, target):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output