# Introduction In computer science, the Longest Increasing Subsequence (LIS) problem is to find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order. This subsequence is not necessarily contiguous, or unique.

Click the virtual machine below to start practicing