For this Question: Given an array <b>Arr</b> of <b>N</b> integers arranged in a circular fashion. Your task is to find the <b>minimum absolute difference between adjacent elements</b>.The input line contains T, denoting the number of testcases. Each testcase contains two lines. The first line contains N(size of array). The second line contains N elements of array separated by space.

<b>Constraint:</b>
1 <= T <= 100
2 <= N <= 10^5
-10^6 <= Arr[i] <= 10^6
Sum of N over all testcases is less than equal to 10^6For each testcase in new line print the minimum absolute difference.Input:
3
7
8 -8 9 -9 10 -11 12
8
10 -3 -4 7 6 5 -4 -1
8
-1 40 -14 7 6 5 -4 -1

Output:
4
1
0

Explanation:
Testcase 1: The absolute difference between adjacent elements in the given array are as such: 16 17 18  19 21 23 4(first and last). Among the calculated absolute difference the minimum is 4.
Testcase 2: The absolute difference between adjacent elements in the given array are as such: 13 1 11 1 1 9 3 11(first and last). Among the calculated absolute difference, the minimum is 1.
Testcase 3: The absolute difference between adjacent elements in the given array are as such: 41 54 21 1 1 9 3 0(first and last). Among the calculated absolute difference, the minimum is 0., I have written this Solution Code: 

def minDiff(arr, n):
	if(n < 2):
		return

	res = abs(arr[1] - arr[0])
	for i in range(2, n):
		res = min(res, abs(arr[i] - arr[i-1]))

	res = min(res, abs(arr[n-1] - arr[0]))	

	return res

for _ in range(int(input())):
	n=int(input())
	arr = list(map(int, input().split()))
	print(minDiff(arr, n)), In this Programming Language: Python, Now tell me if this Code is compilable or not?