Geeksforgeeks

Timer is Running

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.

**Your Task:**

Your 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(n^{2})

**Expected Space Complexity: **O(n)

**Constraints:**

1 <= length of array <= 200

1 <= arr[i] <= 1000000

Author: saksham seth

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

jainshubham52535 | 529 |

Pathak1899 | 436 |

yashdip123 | 380 |

kirtidee18 | 377 |

jots62 | 351 |

kirtidee18 | 1057 |

ykaushik | 752 |

aggarwalvatsal5 | 741 |

harbilassingh | 576 |

pmr_3689 | 570 |

blackshadows | 5456 |

Ibrahim Nash | 5450 |

akhayrutdinov | 5111 |

mb1973 | 4976 |

Quandray | 4827 |

Login to report an issue on this page.