IBM interview question

Longest increasing subsequence leetcode style problem.