Print the elements from the given array, in decreasing order.
 Ex. you are given an arr like [4,5,1,2,3], so output should be -

<BlankLine>
5, 4
<BlankLine>
<BlankLine>
3, 2, 1

 Explanation : first we get 4, & we know that bigger element exists, so can't print it & blank line is printed for this element.
 Next we get 5 & we know that this is the largest element in array not yet printed but we also have some elements before it not yet printed on console. So we need to check if the elements received till 5 can be printed on console without having any bigger element in between from the other array elements. And we see here that both 4 & 5 don't have any other element from the array which can come in between, so we can safely print these 2 elements in decreasing order on the console, like 5, 4
Next 1 comes, we can't print it now, as other big elements still pending, so <BlankLine>
Next 2 comes, we can't print it now, as other big elements still pending, so <BlankLine>
Next 3 comes, we see that no other bigger element remaing now.
So we can check 1,2,3 also like we did for 4 & 5, if no remaining can come in between.
So we print 3, 2, 1

​ Below is one kind of solution, not efficient one & you can provide the better solution in comment section

Find the maximum index difference in the given array of integers, as per below conditions-
  a) 'i' is left index in the given array & 'j' is the right index.
  b) i < j
  c) Array[i] < Array[j]

Can assume the array size as about 1 to 10000
 and numbers in the array can be 1 to 10000000

E.g. : If the given array is [5, 3, 2, 1, 1, 4]
         then answer will be 5, Array[1] < Array[5]
 Explanation : if we pick i as 1 & j as 5 then it satisfies all the above given conditions.

 If no such answer is possible then return 0.
 
 Below is one possible way, which I got while discussing with one colleague, though we both agreed that it doesn't seem to be optimal one as it has O(n*n) run time complexity & it is not the correct one also.
 So request you guys to provide the optimal solution for this below in comment section, so that all get benefited.