caiozanatelli / lisreduction Goto Github PK
View Code? Open in Web Editor NEWA Longest Increasing Subsequence (LIS) reduction to solve a problem similar to the Building Bridges Problem. This implementation covers three different approaches: backtracking, greedy and dynamic programming.
License: MIT License