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.

Sign up for GitHub

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

DP- Longest Increasing Subsequence #378

Open
aditya-11-19 opened this issue Oct 2, 2021 · 1 comment
Open

DP- Longest Increasing Subsequence #378

aditya-11-19 opened this issue Oct 2, 2021 · 1 comment
Assignees
@aditya-11-19
Labels
hacktoberfest

Comments

@aditya-11-19
Copy link
Contributor

In this problem, we have to find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order.
Example:- Sequence- {8,100,150,10,12,14,110}
Length of longest subsequence- 5 // (8,10,12,14,110)
@avinash201199
Copy link
Owner

don't forget to add problem statement in the code file

aditya-11-19 added a commit to aditya-11-19/DSA-Questions that referenced this issue Oct 2, 2021
@aditya-11-19
Create DP- Longest Strictly Increasing Subsequence
55fbc75 
avinash201199#378 
This is my code for https://practice.geeksforgeeks.org/problems/longest-increasing-subsequence-1587115620/1
@aditya-11-19 aditya-11-19 mentioned this issue Oct 2, 2021
Merged
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@aditya-11-19 aditya-11-19

Labels
hacktoberfest
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@aditya-11-19 @avinash201199