FastPrep
Problem · Array

Find Maximum Difference

Learn this problem
● EasyCiscoINTERNNEW GRADOA
See Cisco hiring insights

Problem statement

Given a list of integers, find the maximum difference of two elements where the larger number appears after the smaller number.

Write an algorithm to find the maximum difference of two elements where the larger number appears after the smaller number.

Input

The first line of input consists of an integer - inputArray_size, representing the size of the list (N).

The next line consists of N space-separated integers representing the elements of the list.

Output

Print an integer representing the maximum difference of the two elements where the larger number appears after the smaller number. If no such elements are found, print 0.

Function

findMaximumDifference(n: int, inputArray: List<Integer>) → int

Examples

Example 1

n = 7inputArray = [2, 3, 10, 6, 4, 8, 1]return = 8
From the given list, the maximum difference will be 8 (difference between 2 and 10 :), we won't consider (10 and 1), as the larger number should appear after the smaller one. So, the output is 8 🍻

Example 2

n = 3inputArray = [4, 3, 1]return = 0
Will add once find reliable source :) Just like what we did for the example 1 above 👆 See yall next time!

More Cisco problems

drafts saved locally
public int findMaximumDifference(int n, List<Integer> inputArray) {
  // write your code here
}
n7
inputArray[2, 3, 10, 6, 4, 8, 1]
expected8
checking account