Longest increasing subsequence ending in a[n]

[lgef]

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.

• [x] New feature

Checklist:

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