Medium
Given an array nums of distinct basket positions and an integer target (= m balls), place the balls into baskets so that the minimum distance between any two balls is as large as possible. Return that maximum possible minimum distance.
Input: nums = [1,2,3,4,7], target = 3 Output: 3
Input: nums = [5,4,3,2,1,1000000000], target = 2 Output: 999999999