X

DAYS

:

HOUR

:

MINS

:

SEC

Copied to Clipboard
Longest Bitonic subsequence
Medium Accuracy: 50.0% Submissions: 11343 Points: 4

Given an array of positive integers. Find the maximum length of Bitonic subsequence.
A subsequence of array is called Bitonic if it is first increasing, then decreasing.

Example 1:

Input: nums = [1, 2, 5, 3, 2]
Output: 5
Explanation: The sequence {1, 2, 5} is
increasing and the sequence {3, 2} is
decreasing so merging both we will get
length 5.


Example 2:

Input: nums = [1, 11, 2, 10, 4, 5, 2, 1]
Output: 6
Explanation: The bitonic sequence
{1, 2, 10, 4, 2, 1} has length 6.


You don't need to read or print anything. Your task is to complete the function LongestBitonicSequence() which takes the array nums[] as input parameter and returns the maximum length of bitonic subsequence.

Expected Time Complexity: O(n2)
Expected Space Complexity: O(n)

Constraints:
1 ≤ length of array ≤ 200
1 ≤ arr[i] ≤ 1000000