Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Longest Bitonic Subsequence #266

Open
wants to merge 2 commits into
base: master
Choose a base branch
from

Conversation

nandikeshsingh
Copy link
Contributor

ISSUE NUMBER

#265

SHORT DESCRIPTION

Code to find the longest bitonic subsequence in C++ using dynamic programming.

TESTING

Some inputs with their correct outputs.

Input:-
8
1 11 2 10 4 5 2 1
Output:-
6

Input:-
6
12 11 40 5 3 1
Output:-
5

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

1 participant