Binary Search Coding Challenges

Find the highest altitude at which the drone signal remains stable.

Determine which stage first hits or exceeds the requested cumulative volume.

Find the minimum time needed for ticket windows to serve all festival guests.

Find the smallest lantern radius that covers every pier checkpoint.

Find the lowest beacon frequency that meets or exceeds the patrol request.

Given an array representing positions of existing gas stations along a highway and an integer k, add k more stations so that the maximum distance between adjacent stations is minimized. Return that minimum possible maximum distance.

Given a sorted array of integers and a target value, return the index of the first element that is greater than or equal to the target. If no such element exists, return -1.

Given a list of positive integers and a target value, return the smallest index where the running total is at least the target. If no such index exists, return -1.

Given a sorted array of integers and a target value, return the index of the element whose value is closest to the target. If two values are equally close, return the smaller index. If the array is empty, return -1.

Given a sorted array of integers and a target value, return the index of the last element that is less than or equal to the target. If every element is greater than the target, return -1.

Given a sorted array of integers and a target value, return how many elements are strictly less than the target.

Given a sorted array of integers and a target value, return the starting and ending positions of the target value. If the target is not found, return [-1, -1].