Can we do binary search in O(logN) other than O(2*logN)?

  • 0

    It makes sense to use binary search looking for the left bound and right bound respectively. However, does anyone solve this problem via one binary search successfully finding out both left and right bound?

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.