Binary Search — Easy Coding Interview Question

Given a sorted array of integers and a target, return the index or -1. Must be O(log n).

Example

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

Output: 4

Constraints

• 1 ≤ nums.length ≤ 10⁴

Topics & Companies

Topics: binary-search, arrays

Asked by: Amazon, Google, Meta, Microsoft, Apple

Optimal Solution Complexity

Time complexity: O(log n). Space complexity: O(1).

Practice more

• All DSA Problems
• DSA Patterns