The problem we will solve is given a sequence an array of **positive integers** and have to find the length of **longest bitonic subsequence**. Using dynamic programming ideas, we will solve this on O(N^2) time complexity

**Read this article to understand how to find Longest Bitonic Sequence using Dynamic Programming in depth**

**Have a doubt or thought? Join the discussion now**

This is a companion discussion topic for the original entry at http://iq.opengenus.org/longest-bitonic-sequence/