← Questions
Lower and upper bound binary search
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given an array sorted in non-decreasing order and a target, return the first index whose value is at least the target and the first index whose value is greater than the target. Use them to count the copies of the target, and be careful with the loop bounds.
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