Aggressive Cows Problem Statement

Given an array representing positions of stalls and an integer ‘K’ representing the number of aggressive cows, determine the largest minimum distance between any two cows when they are placed in the stalls such that they are as far apart as possible to prevent aggression.

Input:

The first line contains an integer ‘T’ representing the number of test cases.
For each test case:
The first line contains two integers, ‘N’ and ‘K’, where ‘N’ is the number of stalls, and ‘K’ is the number of cows.
The second line contains ‘N’ space-separated integers, each representing the position of a stall.

Output:

For each test case, output the largest minimum distance between any two cows placed in stalls.

Example:

Input:

T = 1
N = 5, K = 3
ARR = [1, 2, 8, 4, 9]

Output:

3

Constraints:

• 1 <= T <= 5
• 2 <= N <= 20000
• 2 <= K <= N
• 0 <= ARR[i] <= 10^9
• Time Limit: 1 sec.

Note:

No need to print anything. The function should return the result for each test case.