Implement binary search lower/upper bounds

Q: Implement binary search lower/upper bounds

This question evaluates a candidate's understanding of binary search algorithms, handling of boundary conditions and duplicates, and the ability to implement efficient index-finding functions on sorted arrays within the Coding & Algorithms domain.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Given a non-decreasing sorted array nums and a target value, implement two functions using binary search: (

lower_bound(nums, target) that returns the smallest index i such that nums[i] >= target (return len(nums) if no such index exists); (
upper_bound(nums, target) that returns the smallest index i such that nums[i] > target (return len(nums) if no such index exists). Achieve O(log n) time and O(
extra space, and handle duplicates, empty arrays, and targets outside the array’s value range. Clearly explain your boundary conditions and provide a few test cases to demonstrate correctness.

Implement binary search lower/upper bounds

Overview

Comments (0)