✅Maximum value of difference of a pair of elements and their Index(Contest)

Maximum value of difference of a pair of elements and their Index MediumAccuracy: 40.21%

Problem Statement :

Given an array arr[] of N positive integers. Find maximum value of |arr[i] – arr[j]| + |i – j|, (0 <= i, j <= N – 1)

Example 1:

Input:
N = 4 
arr[] = {1, 2, 3, 1}
Output:
4
Explanation:
Choosing i=0 and j=2, will result in
|1-3|+|0-2| = 4, which is the maximum
possible value.

Example 2:

Input:
N = 3 
A[] = {1, 1, 1}
Output:
2
Explanation:
Choosing i=0 and j=2, will result in
|1-1|+|0-2| = 2, which is the maximum
possible value.

Your Task: You don't need to read input or print anything. Your task is to complete the function maxValue() which takes an Integer N and an array arr of size N as input and returns the maximum possoble value of |arr[i] – arr[j]| + |i – j|.

link:https://practice.geeksforgeeks.org/problems/maximum-value-of-difference-of-a-pair-of-elements-and-their-index/1?utm_source=gfg&utm_medium=article&utm_campaign=bottom_sticky_on_article

class Solution {
   static int maxValue(int[] arr, int N) {
       // code here
        int max1 = Integer.MIN_VALUE;
       int min1 = Integer.MAX_VALUE;
       int max2 = Integer.MIN_VALUE;
       int min2 = Integer.MAX_VALUE;

       for (int i = 0; i < arr.length; i++){

           max1 = Math.max(max1, arr[i] + i);
           min1 = Math.min(min1, arr[i] + i);
           max2 = Math.max(max2, arr[i] - i);
           min2 = Math.min(min2, arr[i] - i);
       }

       // Calculating maximum absolute difference.
       return Math.max(max1 - min1, max2 - min2);
   }
}