Microsoft CoCubes Java Programming Question – 2 Maximum difference between two elements such that larger element appears after the smaller number

 

Microsoft CoCubes Java Programming Question – 2

Maximum difference between two elements such that larger element appears after the smaller number

Given an array arr[] of integers, find out the difference between any two elements such that larger element appears after the smaller number in arr[].

Examples: If array is [2, 3, 10, 6, 4, 8, 1] then returned value should be 8 (Diff between 10 and 2). If array is [ 7, 9, 5, 6, 3, 2 ] then returned value should be 2 (Diff between 7 and 9)

Time Complexity: O(n^2)

Auxiliary Space: O(1)

 

Use two loops. In the outer loop, pick elements one by one and in the inner loop calculate the difference of the picked element with every other element in the array and compare the difference with the maximum difference calculated so far.

 

Program :

 

// Microsoft CoCubes Java Programming Question – 2

 

import java.util.*;

 

class MaximumDifference {

    int maxDiff(int arr[], int arr_size) {

        int max_diff = arr[1] - arr[0];

        int i, j;

        for (i = 0; i < arr_size; i++) {

            for (j = i + 1; j < arr_size; j++) { if (arr[j] - arr[i] > max_diff)

                    max_diff = arr[j] - arr[i];

            }

        }

        return max_diff;

    }

 

    public static void main(String[] args) {

        MaximumDifference maxdif = new MaximumDifference();

        int arr[] = {7,9,5,6,3,2};

        System.out.println("\nMaximum differnce is " + maxdif.maxDiff(arr, 5));

    }

}

For Output check the Video :