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

Longest increasing subsequence ending in a[n] #380

Open

lgef wants to merge 3 commits into prabhupant:master from lgef:longest-increasing-subsequence-ending

lgef commented Jul 16, 2020

Description

Implemented DP algorithm for the longest increasing subsequence ending in the last entry of the given array.

Fixes # (issue)

Type of change

Please delete options that are not relevant.

New feature

Checklist:

My code follows the style guidelines of this project i.e. Pep8
I have performed a self-review of my own code
I have commented my code, particularly in hard-to-understand areas
I have made corresponding changes to the documentation
Any dependent changes have been merged and published in downstream modules
I have squashed unnecessary commits

lgef added 3 commits

July 15, 2020 22:16


          Added longest increasing subsequence ending with the last entry of A …

3af558c

…DP algorithm


          nit changes

c131d3d


          added forgotten character

36845f5

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet