Given a list of integers, write a function to find the longest subsequence where each element is strictly greater than the previous element in the subsequence. Return the length of the longest subsequence found.
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.