An array arr a mountain if the following properties hold: arr.length >= 3 There exists some i with 0 arr[i + 1] > ... > arr[arr.length - 1] Given a mountain array arr, return the index i such that arr[0] arr[i + 1] > ... > arr[arr.length - 1]. You must solve it in O(log(arr.length)) time complexity.