[NEW ALGORITHM] Want to add Longest Increasing sequence in dp

[Manish5043]

Description:

The Longest Increasing Subsequence (LIS) problem involves finding the longest subsequence in a given array where elements are strictly increasing in order. The subsequence doesn't need to be contiguous. Solutions typically use dynamic programming with a time complexity of (O(n^2)), or optimized methods using binary search in (O(n \log n)).

Checklist:

• [ ] Contributor in GSSoC-ext
• [ ] Want to work on it

Additional Information:

Provide any other relevant information or resources regarding the algorithm.

[Manish5043]

@pankaj-bind kindly assign me

[pankaj-bind]

@Manish5043 assigned

[Manish5043]

kindly add hactoberfest-accepted label as it is under the guidelines