input: Write a python function to find the length of the longest increasing subsequence.
  assert find_longest([1, 2, 3, 2, 3, 4, 5, 1, 2, 3, 4]) == 5
  assert find_longest([5, 4, 3, 2, 1]) == 1
  assert find_longest([10, 20, 30, 1, 2, 3, 50, 60]) == 4
output: def find_longest(nums):
      if not nums:
          return 0
      
      dp = [1] * len(nums)
      
      for i in range(1, len(nums)):
          for j in range(i):
              if nums[i] > nums[j]:
                  dp[i] = max(dp[i], dp[j] + 1)
      
      return max(dp)