Select Best Driver Block

Problem Statement

Select Best Driver Block Problem Description An operations team must select a contiguous block of drivers to cover an upcoming surge window. Each driver has a remaining available drive time (in minutes) for the shift. When assigning a contiguous block of drivers of fixed size, the block's effective availability is constrained by the least-available driver inside that block (the block bottleneck). The team will evaluate every contiguous block of the given size and then choose the block with the highest effective availability so that the surge window is served reliably. Given an array of integers representing each driver's remaining available minutes in line on a route, and an integer groupSize representing the number of adjacent drivers to select, determine the maximum effective availability (i.e., the maximum among minima of all contiguous blocks of size groupSize ). Complete the function selectBestDriverBlock in the editor with the following parameters: groupSize : int — required numb