Practice Binary Search
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1. You must write an algorithm with O(log n) runtime complexity.
Source: Binary Search on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [-1,0,3,5,9,12], target = 9
Output
4
# Example 2
Input
nums = [-1,0,3,5,9,12], target = 2
Output
-1
Constraints
1 <= nums.length <= 10^4
-10^4 < nums[i], target < 10^4
All the integers in nums are unique.
nums is sorted in ascending order.
Related LeetCode Problems
Practice more problems similar to Binary Search.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.