LeetCode 34. Search for a Range


Given an array of integers sorted in ascending order, find the starting and ending position of a given target value.

Your algorithm’s runtime complexity must be in the order of O(log n).

If the target is not found in the array, return [-1, -1].

For example,
Given [5, 7, 7, 8, 8, 10] and target value 8,
return [3, 4].


Use binary search twice to solve the problem. The first binary search to find the first occurrence of the target. The second binary search to find the second occurrence of the target.

Video Tutorial

Java Solution

2 Thoughts to “LeetCode 34. Search for a Range”

Leave a Reply

Your email address will not be published. Required fields are marked *