Length of Longest Increasing Subsequences (LIS) using DynamicProgramming and Segment Tree

[januslinhc]

Is your feature request related to a problem? Please describe.
I would like to add a sample Dynamic Programming solution for Length of Longest Increasing Subsequences (LIS).

Describe the solution you'd like
The problem will be addressed by using dynamic programming approach with segment tree. The expected solution would have time complexity of O(N*log N).

Additional context
https://www.geeksforgeeks.org/length-of-longest-increasing-subsequences-lis-using-segment-tree/

As part of Hacktoberfest 2021, I would like to add this implementation, could you please assign this to me @siriak.

[github-actions]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions]

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Gitter or ping one of the reviewers. Thank you for your contributions!