Help me in solving HORSES problem

help
,
1

My issue

t=int(input())
for i in range(t):
n=int(input())
l=list(map(int,input().split()))
a=
d=0
l=list(set(l))
l.sort()
for i in range(len(l)):
if (l[i]-l[i-1])>0:
d=(l[i]-l[i-1])
a.append(d)
print(min(a))
what"s wrong in this code

My code

# cook your dish here
t=int(input())
for i in range(t):
    n=int(input())
    l=list(map(int,input().split()))
    a=[]
    d=0
    l=list(set(l))
    l.sort()
    for i in range(len(l)):
        if (l[i]-l[i-1])>0:
           d=(l[i]-l[i-1])
           a.append(d)
    print(min(a))

Learning course: Sorting using Python
Problem Link: CodeChef: Practical coding for everyone

2

@khushisahu0108
just few little logical mistakes
i have corrected it in your code .
hope u will get it

# cook your dish here
t=int(input())
for i in range(t):
    n=int(input())
    l=list(map(int,input().split()))
    a=[]
    d=0
    l.sort()
    for i in range(1,len(l)):
           d=(l[i]-l[i-1])
           a.append(d)
    print(min(a))