Question d’entretien chez AMD

coding question: find longest increasing subsequence in a given non-empty array