← Questions
Find first and last position of an element in a sorted array
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given an array of integers sorted in non-decreasing order and a target value, return the index of the first and the last occurrence of the target, or [-1, -1] when it is absent. The solution should run in O(log n), so use binary search rather than a scan.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding