Leetcode 704. Binary Search

Given a sorted (ascending) array of unique integers and a target value, return the index of the target or -1 if not present; the solution must run in O(log n) time (i.e., implement binary search).

Asked at:

Google

Amazon

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid November, 2025

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 704. Binary Search

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact