An electric vehicle travels along a highway between a start and a destination. Charging stations are located at positions given in a non-decreasing integer array stations, where stations[0] is the start and the last element is the destination. You are allowed to add at most k extra charging stops at any positions along the highway.

Your goal is to minimize the maximum gap between any two consecutive stops after placing the extra stops optimally. Return the minimized maximum segment length as an integer. ...