LeetCode 774: Minimize Max Distance to Gas Station
Problem Restatement We are given a sorted array stations . Each value in stations is the position of an existing gas station on the x-axis. We are also given an integer k . We must add exactly k new gas stations. A new gas station can be placed anywhere on the x-axis, including non-integer positions. After adding the new stations, define the penalty as the maximum distance between two adjacent...