Dynamic Programming: Longest Increasing Subsequence (LIS)

Problem Given an integer array, return the length of the longest strictly increasing subsequence. Tabulation (O(n^2))