Max Power | Editorial by aksingh007

Sort the array.Then,print the MAX-MIN. Take care of the corner test-cases.
```
import java.util.*;
class TestClass {
    public static void main(String args[] ) throws Exception {
        Scanner sc = new Scanner(System.in);
        int t=sc.nextInt();
        while(t-->0){
            int n=sc.nextInt();
            boolean flag=false;
            int arr[]=new int[n];
            for(int i=0;i<n;arr[i++]=sc.nextInt());
            int min=Integer.MAX_VALUE;
            int posmin=0;
            for(int i=0;i<n;i++)
                if(arr[i]<min){
                    min=arr[i];
                    posmin=i;
                }
            int max=0;int posmax=0;
            for(int i=0;i<n;i++)
                if(arr[i]>max){
                    max=arr[i];
                    posmax=i;
                }
                Arrays.sort(arr);
                if(n==2){
                    System.out.println(arr[n-1]-arr[0]);
                    continue;
                }

if(posmin==n-1 && posmax==0){
                int ans=Math.max(arr[n-1]-arr[1],arr[n-2]-arr[0]);
            
            System.out.println(ans);
            }
            else
            System.out.println(arr[n-1]-arr[0]);
        }
    }
}

```

Max Power | Editorial by aksingh007

Download submission

All caught up!

View submission

Is your resume even shortlisted?