Question d’entretien chez Sigmoid

Round 2: With a given unsorted array find the longest increasing subsequence.