Given a sorted list nums of distinct integers and a target, return the index of target, or -1 if it is not present. Your solution must run in O(log n).
Input: nums = [-1, 0, 3, 5, 9, 12], target = 9 Output: 4
Input: nums = [-1, 0, 3, 5, 9, 12], target = 2 Output: -1
1 <= len(nums) <= 10^4 nums is sorted ascending
Solve it in the live editor on this page — run on sample data, then submit against hidden tests.
‹ Maximal Rectangle in a Binary Matrix · Search Insert Position ›
{{ totalCount }} questions · {{ shHardPct }}% Hard. Data structures & algorithms interview problems in 13 patterns. Solve in Python, JavaScript or Java in your browser, run sample tests, then submit against hidden tests.
Guests can solve {{ freeLimit }} problems for free. Log in or sign up (free) to unlock everything, keep your streak and appear on the leaderboard. New to a topic? Learn it first in the DSA course.
{{ p.statement }}
{{ p.constraints }}
No submissions yet. Press Submit to judge your code against all tests.
The model solution and step-by-step explanation unlock when you solve this problem or after 3 unsuccessful submissions ({{ shFailsLabel }}). Struggling? Try the hints on the Question tab first.
{{ solutionCode }}
Create your free TechTown account to unlock every problem, track your progress, bookmark questions and keep preparing for interviews.