Rubrik | SDE1 | OA.

Question

Answer 1

You are given  array b and an integer p. Find p pairs of indices of b such that the maximum difference amongst all the pairs is minimized. Also, ensure no index appears more than once amongst the p pairs.

Note that for a pair of elements at the index i and j, the difference of this pair is |nums[i] - nums[j]|, where |x| represents the absolute value of x.

Return the minimum maximum difference among all p pairs. We define the maximum of an empty set to be zero.

 

Example 1:

Input: nums = [10,1,2,7,1,3], p = 2
Output: 1

Example 2:

Input: nums = [4,2,1,2], p = 1
Output: 0