Accenture interview question

Dp problem longest increasing subsequence, sorting algorithm.