Problem Finding the Minimum Value in a Valley-Shaped Array Examples Example 1: Input: arr = [12, 8, 4, 2, 3, 10]; Output: 3 Solution Method 1 - Binary Search Use a binary search to efficiently find the trough element (the minimum value) in the array. ...
Problem An array arr a mountain if the following properties hold: arr.length >= 3 There exists some i with 0 < i < arr.length - 1 such that: arr[0] < arr[1] < ... < arr[i - 1] < arr[i] arr[i] > arr[i + 1] > ... > arr[arr.length - 1] Given a mountain array arr, return the index i such that arr[0] < arr[1] < ... < arr[i - 1] < arr[i] > arr[i + 1] > ... > arr[arr.length - 1]. ...
Problem Given an array that is either first increasing and then decreasing (bitonic or mountain array), or first decreasing and then increasing (valley-shaped array): If the array is first increasing and then decreasing, find the peak element. If the array is first decreasing and then increasing, find the valley (minimum) element. Examples Example 1: Input: arr = [2, 4, 6, 8, 10, 3, 1] Output: 4 ...