Minimum adjacent difference in a circular array

PHOTO EMBED

Tue Feb 08 2022 06:10:45 GMT+0000 (Coordinated Universal Time)

Saved by @Uttam #java #gfg #geeksforgeeks #arrays #practice #circulararray #adjacentdifference #minimumadjacentdifference

class Solution{
    
    //Function to find minimum adjacent difference in a circular array.
    // arr[]: input array
    // n: size of array
    public static int minAdjDiff(int arr[], int n) {
    
       int min=Math.abs(arr[0]-arr[n-1]),diff;
        for(int i=0;i<n-1;i++)
        {
            diff=Math.abs(arr[i]-arr[i+1]);
            if(diff<min)
            min=diff;
        }
        return min;
       
    }
}
content_copyCOPY

Minimum adjacent difference in a circular array Given an array Arr of n integers arranged in a circular fashion. Your task is to find the minimum absolute difference between adjacent elements. Example 1: Input: n = 7 Arr[] = {8,-8,9,-9,10,-11,12} Output: 4 Explanation: 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. Example 2: Input: n = 8 Arr[] = {10,-3,-4,7,6,5,-4,-1} Output: 1 Explanation: 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. Your Task: The task is to complete the function minAdjDiff() which returns the minimum difference between adjacent elements in circular array. Expected Time Complexity: O(n). Expected Auxiliary Space: O(1). Constraint: 2 <= n <= 10^6 -10^6 <= Arr[i] <= 10^6

https://practice.geeksforgeeks.org/problems/minimum-absloute-difference-between-adjacent-elements-in-a-circular-array-1587115620/1/?track=DSASP-Arrays&batchId=190