Find the length of the longest increasing subsequence in an array.

• Use dynamic programming to solve the problem.

• The time complexity of the algorithm should be O(n^2).

• Example: For the array [10, 22, 9, ...read more