Loading your interview setup

Skip to content

Overview Resume Score

Practice

The Daily LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading

easy· binary-search Mock interview

Binary Search

Given a sorted ascending array `nums` of distinct integers and a `target`, return the index of target, or -1 if it is not present. Run in O(log n).

Examples

in: nums = [-1,0,3,5,9,12], target = 9

out: 4

9 is at index 4

in: nums = [-1,0,3,5,9,12], target = 2

out: -1

absent

Constraints

0 <= len(nums) <= 10^4
nums is sorted ascending, distinct

Hints

target: O(log n) time⌘↩ run · ⇧⌘↩ submit