Longest Increasing Subsequence Using Dynamic Programming

Longest Increasing Subsequence Using Dynamic Programming: a task in Terminal-Lego-15k (Harbor dataset). Implement a program that finds the Longest Increasing Subsequence (LIS) of a given set of integers using dynamic programming .