Problem Statement

Find the maximum value in a given Bitonic array. An array is considered bitonic if it is first strictly increasing and then strictly decreasing.

In other words, a bitonic array starts with a sequence of increasing elements, reaches a peak element, and then follows with a sequence of decreasing elements. The peak element is the maximum value in the array.

Example 1:

Input: [1, 3, 8, 12, 4, 2]
Output: 12
Explanation: The maximum number in the input bitonic array is '12'.

Example 2:

Input: [3, 8, 3, 1]
Output: 8

Example 3:

Input: [1, 3, 8, 12]
Output: 12

Example 4:

Input: [10, 9, 8]
Output: 10

Constraints:

• 1 <= arr.length <= 10⁵
• -10⁵ <= arr[i] <= 10⁵
• No two neighbours are equal, so arr[i] != arr[i + 1] for every valid i.
• Either slope may be empty. An array that only rises, or only falls, is still bitonic.

Try it yourself

Try solving this question here: