Freaks City

Longest Encreasing Subsequence The problem can be solved using a greedy approach by maintaining a sequence that represents the smallest possible tail value for all increasing subsequences of each length. The key insight is that for any increasing subsequence, if we encounter a number that's smaller than the current tail of our sequence, we can ...