Longest Increasing Subsequence (LIS)
Example:
Input: [10, 22, 9, 33, 21, 50, 41, 60, 80], Output: 6
Save For Revision
Save For Revision
Bookmark this item, mark it difficult, or place it in a revision set.
Log in to save bookmarks, difficult questions, and revision sets.