Binary Search in Sorted Array

EasyPython00:00

Practice interviewer

Your interviewer

In session

Interviewer

Welcome to the Python screen.

The question is on your right: Binary Search in Sorted Array. Read through the requirements first.

Run and submit your code as often as you need. You also have five interviewer messages this session - want to talk through your approach, or are you ready to start coding?

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

Problem

At Stripe, a service stores sorted numeric IDs in memory and needs fast lookups. Implement binary search to find the index of a target value in a sorted array.

Given a sorted list of integers nums in ascending order and an integer target, return the index of target if it exists. Otherwise, return -1.

Formal Specification

Input: nums (list of integers sorted in ascending order), target (integer)
Output: Integer index of target, or -1 if not found

Constraints

1 <= len(nums) <= 10^5
-10^9 <= nums[i], target <= 10^9
nums is sorted in ascending order
All values in nums are distinct

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