Maximum Index GFG POTD Python Solution geeks for geeks problem of the day python solution
Problem - https://www.geeksforgeeks.org/problem...
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)
On this page of the site you can watch the video online Maximum Index GFG POTD Python Solution geeks for geeks problem of the day python solution with a duration of hours minute second in good quality, which was uploaded by the user VS Code 04 March 2024, share the link with friends and acquaintances, this video has already been watched 357 times on youtube and it was liked by 5 viewers. Enjoy your viewing!
