Challenge: Array Index Maximum Difference

Problem

Given an array arr[] of integers, find the two largest differences between indices i and j in the array such that:

1. i is less than j

...