Your question is Binary Search Time Bounds. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
Bloomberg time-series streams can contain repeated timestamps, such as multiple B-PIPE observations recorded at the same nanosecond. Given a sorted, nondecreasing array of integer timestamps and an inclusive time range, return the half-open index interval containing every timestamp in that range.
Implement time_range_bounds(timestamps, start, end) without using Python's bisect module.
timestamps, a list of integers sorted in nondecreasing order; start and end, integer timestamps with start <= end.[left, right] where left is the first index with timestamps[left] >= start, and right is the first index with timestamps[right] > end. The matching observations are therefore timestamps[left:right].[k, k], where k is the insertion position for the range.The algorithm must use binary search and run in O(log n) time. Do not scan the array linearly, including to skip duplicate timestamps.
def time_range_bounds(timestamps, start, end):