Given an array of integers, this algorithm finds the length of the longest increasing subsequence in the array. For example, given the input [10, 9, 2, 5, 3, 7, 101, 18], the output would be 4.

A.I. Evaluation of the Solution

The candidate's solution is correct and uses dynamic programming to solve the problem. However, the solution is not very efficient because it uses two for loops.

Evaluated at: 2022-11-19 16:15:53