Minimum Wand Difference

You are given \( T \) test cases. In each test case, there are \( N \) magical wands, each with a given power value. Your task is to find the minimum absolute difference between the power values of any two wands in each test case.

The absolute difference between two numbers \( a \) and \( b \) is defined as \( |a-b| \). It is guaranteed that each test case contains at least two wands.

inputFormat

The input begins with an integer \( T \), the number of test cases. For each test case:

• The first line contains an integer \( N \), the number of wands.
• The second line contains \( N \) space-separated integers representing the power values of the wands.

outputFormat

For each test case, output a single line containing the minimum absolute difference between any two wand power values.

2
5
3 8 15 10 20
3
1 6 2

2
1