You are given an array of positive integers price, where each element represents the price of a candy, and an integer k.

A candy basket contains k distinct candies chosen from price. The tastiness of a candy basket is defined as the minimum absolute difference between the prices of any pair of candies in the basket.

Return the maximum tastiness that can be achieved for a basket containing k candies.

Constraints:

• $2 \leq$ k $\leq$ price.length $\leq 10^5$

• $1 \leq$ price[i] $\leq 10^9$

Input: price = [4, 11]-List[int], k = 2-int
Output: 7-int
Explanation: Choosing candies priced 4 and 11 gives a minimum absolute difference of 7, which is the maximum possible for two candies.

Input: price = [2, 9, 17, 28, 41]-List[int], k = 4-int
Output: 11-int
Explanation: Selecting prices 2, 17, 28, and 41 results in pairwise differences whose minimum is 11, and no selection of four candies can achieve a larger minimum difference.

Input: price = [6, 6, 6, 10, 10]-List[int], k = 3-int
Output: 0-int
Explanation: Any selection of three candies must include two candies with the same price, so the minimum absolute difference is 0.

Input: price = [1, 500000000, 1000000000]-List[int], k = 2-int
Output: 999999999-int
Explanation: Choosing candies priced 1 and 1000000000 gives an absolute difference of 999999999, which is the maximum possible.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.