Skip to content

/ Algorithms

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

Jump to bottom

Longest Bitonic Subsequence #266

Open
wants to merge 2 commits into
base: master
from
Open

Longest Bitonic Subsequence #266

wants to merge 2 commits into from
+91 −0

Conversation

@nandikeshsingh
Copy link
Contributor

@nandikeshsingh nandikeshsingh commented Dec 31, 2017

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
@nandikeshsingh
Longest Bitonic Subsequence
Loading status checks…
f093de0
@nandikeshsingh
Update Longest Bitonic Subsequence.cpp
Verified
This commit was created on GitHub.com and signed with a verified signature using GitHub’s key.
GPG key ID: 4AEE18F83AFDEB23 Learn about signing commits
Loading status checks…
339a669
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Linked issues

Successfully merging this pull request may close these issues.

None yet

1 participant
@nandikeshsingh
You can’t perform that action at this time.