Find the longest increasing subsequence in an array

• Use dynamic programming to solve this problem

• Iterate through the array and keep track of the longest increasing subsequence ending at each index

• Time ...read more