Question d’entretien chez Accenture

Dp problem longest increasing subsequence, sorting algorithm.