Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 5725 |

@blackshadows | 5685 |

@akhayrutdinov | 5111 |

@mb1973 | 4989 |

@Quandray | 4908 |

@saiujwal13083 | 4156 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3511 |

@sushant_a | 3453 |

@KshamaGupta | 3318 |

@the_coder95 | 3302 |

Complete Leaderboard | |

Handle | Score |

@shashi1iitk | 398 |

@Suniti Jain | 114 |

@ankish2000nayak | 104 |

@gopalsethlnct | 94 |

@senthil1185 | 90 |

@esmadhan | 90 |

@gyanadipta07 | 89 |

@satwikdash2000 | 85 |

@varunmishra3040 | 83 |

@gamec1634 | 82 |

@pj_1721 | 80 |

Complete Leaderboard |

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

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Longest Bitonic subsequence

...

Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.