# CoCubes 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.

### C

#include

/* The function assumes that there are at least two
elements in array.
The function returns a negative value if the array is
sorted in decreasing order.
Returns 0 if elements are equal */
int maxDiff(int arr[], int arr_size)
{
int max_diff = arr – arr;
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;
}

/* Driver program to test above function */
int main()
{
int arr[] = {1, 2, 90, 10, 110};
printf(“Maximum difference is %d”, maxDiff(arr, 5));
getchar();
return 0;
}

### Java

class MaximumDiffrence
{
/* The function assumes that there are at least two
elements in array.
The function returns a negative value if the array is
sorted in decreasing order.
Returns 0 if elements are equal */
int maxDiff(int arr[], int arr_size)
{
int max_diff = arr – arr;
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;
}

/* Driver program to test above functions */
public static void main(String[] args)
{
MaximumDiffrence maxdif = new MaximumDiffrence();
int arr[] = {1, 2, 90, 10, 110};
System.out.println(“Maximum differnce is ” +
maxdif.maxDiff(arr, 5));
}

## Tricky Solution but Efficient

Method 2 (Tricky and Efficient)
In this method, instead of taking difference of the picked element with every other element, we take the difference with the minimum element found so far. So we need to keep track of 2 things:
1) Maximum difference found so far (max_diff).
2) Minimum number visited so far (min_element).

Time Complexity: O(n)
Auxiliary Space: O(1)

### C

#include<stdio.h>

/* The function assumes that there are at least two
elements in array.
The function returns a negative value if the array is
sorted in decreasing order.
Returns 0 if elements are equal */
int maxDiff(int arr[], int arr_size)
{
int max_diff = arr – arr;
int min_element = arr;
int i;
for(i = 1; i < arr_size; i++)
{
if (arr[i] – min_element > max_diff)
max_diff = arr[i] – min_element;
if (arr[i] < min_element)
min_element = arr[i];
}
return max_diff;
}

/* Driver program to test above function */
int main()
{
int arr[] = {1, 2, 6, 80, 100};
int size = sizeof(arr)/sizeof(arr);
printf(“Maximum difference is %d”, maxDiff(arr, size));
getchar();
return 0;

### Java

class MaximumDiffrence
{
/* The function assumes that there are at least two
elements in array.
The function returns a negative value if the array is
sorted in decreasing order.
Returns 0 if elements are equal */
int maxDiff(int arr[], int arr_size)
{
int max_diff = arr – arr;
int min_element = arr;
int i;
for (i = 1; i < arr_size; i++)
{
if (arr[i] – min_element > max_diff)
max_diff = arr[i] – min_element;
if (arr[i] < min_element)
min_element = arr[i];
}
return max_diff;
}

/* Driver program to test above functions */
public static void main(String[] args)
{
MaximumDiffrence maxdif = new MaximumDiffrence();
int arr[] = {1, 2, 90, 10, 110};
int size = arr.length;
System.out.println(“MaximumDifference is ” +
maxdif.maxDiff(arr, size));
}
}

### 11 comments on “CoCubes Programming Question – 2”

• Ravi Chandra

n=int(input(“Enter the size of the array”))
array=list(map(int,input().split()))
ma=array
for i in range(n):
for j in range(i+1,n):
if(array[i]ma):
ma=array[j]-array[i]
print(ma) 0 0
• SaiManoj

#include
int main()
{
int n,a,i,dif,max=0;
scanf(“%d”,&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
dif=a-a;
for(i=1;i<=n;i++)
{
for(int j=i+1;j=a[i])
dif=a[j]-a[i];
if(max<dif)
max=dif;
}
}
printf("%d",max);
return 0;
} 0 1
•  0 0
• Venkata Naga Sai Annaluri

l=list(map(int,input().split()))
r=[]
n=len(l)
for i in range(n):
if l[i]>= max(l[i:n]):
r.append(l[i])
print(r) 1 0
• Venkata Naga Sai Annaluri

l=list(map(int,input().split()))
r=[]
n=len(l)
for i in range(n):
if l[i]>= max(l[i:n]):
r.append(l[i])
print(r)

use the indentations… 1 0
• shivam mishra

l=list(map(int,input().strip().split(” “)))
l1=[]
for i in range(len(l)):
for j in range(i,len(l)):
if i!=j:
if l[i]<l[j]:
l1.append(l[j]-l[i])
print(max(l1)) 0 0
• Mohd Saif

#include
using namespace std;
void diff_arr(int arr[],int n){
vector temp_arr;
temp_arr.push_back(arr);
int k=0;
for(int i=1;itemp_arr.back()){
temp_arr.push_back(arr[i]);
k+=1;
}
}
int x=temp_arr[k];
int pos2;
for(int i=0;i<n;i++){
if(x==arr[i]){
pos2=i;
}
}
for(int i=1;iarr[i]){
int pos3=i;
if(pos3<pos2){
temp_arr=arr[i];
}
}
}
x=(temp_arr[k]-temp_arr);
cout<>n;
int arr[n];
for(int i=0;i>arr[i];
}
diff_arr(arr,n);
return 0;
} 0 0
• prince

arr=list(map(int,input().split()))
arr1=arr.copy()
arr1.sort()
a=arr1[len(arr1)-1]
b=arr.index(a)
mylist=list(arr[0:b])
mylist.sort()
c=mylist
print (a-c) 0 0
• Suraj Potti

Solution for this question in Python.
maxi = 0
diff = 0
arr = [ 9, 7, 6, 5, 3, 2 ]
for i in range(len(arr)-1):
sub_max = max(arr[i:len(arr)]) #slicing the array after the current index.
if(i maxi):
maxi = diff
else:
pass
else:
pass
print(maxi)
This code will return zero if no such numbers satisfying the conditions exists. 0 0
• PrepInsta

Cocubes Coding Questions 🙂 0 0
• PrepInsta

Cocubes Coding Questions 0 0