Minimum Difference between adjacent number in a circular array

Author: kajal1801

Array/MinimumDiff.java

@@ -0,0 +1,45 @@
+import java.io.*;
+
+class Mini{
+    
+    //Function to find minimum adjacent difference in a circular array.
+    // arr[]: input array
+    // n: size of array
+    public int minAdjDiff(int arr[], int n) {
+        int min = Math.abs(arr[0] - arr[n-1]);
+        
+        for(int i = 0;i<n-1;i++){
+            min = Math.min(min,Math.abs(arr[i] - arr[i+1]));
+        }
+        return min;
+    }
+}
+
+
+public class MinimumDiff {
+    
+	public static void main (String[] args) throws IOException {
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+		int t = Integer.parseInt(br.readLine().trim()); //Inputting the testcases
+		
+		while(t-->0)//While testcases exist
+		{
+		    //Input size of array
+		    int n = Integer.parseInt(br.readLine().trim());
+		    
+		    //Array of size n
+		    int arr[] = new int[n];
+		    
+		    String inputLine[] = br.readLine().trim().split(" ");
+		    
+		    //input elements of array
+		    for(int i=0; i<n; i++){
+		        arr[i]=Integer.parseInt(inputLine[i]);
+		    }
+		    
+		    Mini obj = new Mini();
+		    
+		    System.out.println(obj.minAdjDiff(arr, n));
+		}
+	}
+}