input: Write a python function to find the length of the longest increasing subsequence in a given list of integers.
  assert findLongestIncreasingSubsequence([10, 22, 9, 33, 21, 50, 41, 60, 80]) == 6
  assert findLongestIncreasingSubsequence([3, 10, 2, 1, 20]) == 3
  assert findLongestIncreasingSubsequence([3, 2]) == 1
output: def findLongestIncreasingSubsequence(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)