Increase Sub-sequence

[JangoBoogaloo]

Construct Subsequence

Option 1 - Dynamic Programming

Option 2 - Binary Search (Bisect)

[JangoBoogaloo]

Increasing Triplet Subsequence Medium Russian Doll Envelopes Hard Maximum Length of Pair Chain Medium Number of Longest Increasing Subsequence Medium Minimum ASCII Delete Sum for Two Strings Medium Minimum Number of Removals to Make Mountain Array Hard Find the Longest Valid Obstacle Course at Each Position Hard Minimum Operations to Make the Array K-Increasing Hard Longest Ideal Subsequence Medium Maximum Number of Books You Can Take Hard Longest Increasing Subsequence II Hard Find the Maximum Length of a Good Subsequence II Hard Find the Maximum Length of a Good Subsequence I Medium Find the Maximum Length of Valid Subsequence I Medium Find the Maximum Length of Valid Subsequence II