Sari-Amin
diff --git a/‎Codeforces Problems/Remove-Smallest.py
+17 b/‎Codeforces Problems/Remove-Smallest.py
+17
diff --git a/‎Geeksforgeeks/Equilibrium-point.py ‎Geeksforgeeks Problems/Equilibrium-point.py b/‎Geeksforgeeks/Equilibrium-point.py ‎Geeksforgeeks Problems/Equilibrium-point.py
diff --git a/‎Geeksforgeeks/Selection-sort.py ‎Geeksforgeeks Problems/Selection-sort.py b/‎Geeksforgeeks/Selection-sort.py ‎Geeksforgeeks Problems/Selection-sort.py
diff --git a/‎Geeksforgeeks/Subarray-with-0-sum.py ‎Geeksforgeeks Problems/Subarray-with-0-sum.py b/‎Geeksforgeeks/Subarray-with-0-sum.py ‎Geeksforgeeks Problems/Subarray-with-0-sum.py
@@ -0,0 +1,17 @@
+t= int(input())
+for i in range(t):
+    n = int(input())
+    ls = [int(j) for j in input().split()]
+    ls.sort()
+    ans = True
+    ptr = 0
+    while ptr != n - 1:
+        if abs(ls[ptr]-ls[ptr + 1]) <= 1:
+            ptr += 1
+        else:
+            ans = False
+            break
+    if ans:
+        print("YES")
+    else:
+        print("NO")