Geeksforgeeks

X

DAYS

:

HOUR

:

MINS

:

SEC

Error

Copied to Clipboard

Given an array **A[]** of **N** positive integers. The task is to find the maximum of **j - i** subjected to the constraint of **A[i] < A[j] and i < j**.

**Example 1:**

**Input:
**N = 2
A[] = {1, 10}
**Output:
**1**
Explanation:
**A[0]__<__A[1] so (j-i) is 1-0 = 1.

**Example 2:**

**Input:
**N = 9
A[] = {34, 8, 10, 3, 2, 80, 30, 33, 1}
**Output:
**6**
Explanation:
**In the given array A[1] < A[7]
satisfying the required
condition(A[i] __<__ A[j]) thus giving
the maximum difference of j - i
which is 6(7-1).

**Your Task:**

The task is to complete the function **maxIndexDiff**() which finds and returns maximum index difference. Printing the output will be handled by driver code. Return **-1** in case no such index is found.

**Expected Time Complexity: **O(N)

**Expected Auxiliary Space: **O(N)

**Constraints:**

1 ≤ N ≤ 10^{7}

0 ≤ A[i] ≤ 10^{9}

We are replacing the old Disqus forum with the new Discussions section given below.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Maximum Index

...