146. Longest Increasing Subsequence

Write a function solve that finds the length of the longest strictly increasing subsequence in an array of integers.

Example:
Input: [10,9,2,5,3,7,101,18]
Output: 4
Explanation: The longest increasing subsequence is [2,3,7,101], therefore the length is 4.

Run this challenge interactively in Python or JavaScript when the app loads.