Problem Brief

Find Length of Longest Bitonic Subarray

See IBM online assessment and hiring insights

A bitonic sequence is a sequence of numbers that first increase (non-decreasing) and then decreases (non-increasing). Given an array of integers, find the length of the longest subarray that is bitonic in nature.

1Example 1

Input

arr = [10, 8, 9, 15, 12, 6, 7]

Output

Explanation

[8,9,15,12,6] is the longest bitonic subarray. Return its length, 5.

2Example 2

Input

arr = [5, 1, 2, 1, 4, 5]

Output

Explanation

[1,2,1]is the longest bitonic subarray. Note that the subarray[1,4,5]is also bitonic in nature and has the same length. It is non-decreasing through[1,4,5]and the non-increasing portion is[5].

3Example 3

Input

arr = [9, 7, 6, 2, 1]

Output

Explanation

The non-decreasing subarray is[9]. The non-increasing subarray is the entire array. The entire array has 5 elements.

Constraints

Limits and guarantees your solution can rely on.

1 ≤ n ≤ 10^5
1 ≤ arr[i] ≤ 10^9

Draft autosaves locally

public int findLengthOfLongestBitonicSubarray(int[] arr) {
  // write your code here
}

Input

arr

[10, 8, 9, 15, 12, 6, 7]

Output