Longest Increasing Subsequence (LIS) Interactive Visualizer
Longest Increasing Subsequence finds the longest strictly increasing subsequence of an array in O(n^2) via classic DP or O(n log n) via patience sorting with binary search.
Study Longest Increasing Subsequence (LIS) Explanation · View Multi-Language Code · All Algorithms