pyassistant

Longest Increasing Subsequence Length

You are given a list of integers. Write a function to find the length of the longest increasing subsequence in the list. A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.

Example:

Input:
[10, 9, 2, 5, 3, 7, 101, 18]
Output:
4

Make sure you return your solution, don't print!

AI

Bot

Trying to solve my challenge? Ask if you must, or press the purple button so I can analyze your code.