input: Write a python function to find the longest common subsequence of two strings.
  assert findLongestCommonSubsequence("abcde", "ace") == 3
  assert findLongestCommonSubsequence("abc", "abc") == 3
  assert findLongestCommonSubsequence("abc", "def") == 0
output: def findLongestCommonSubsequence(text1: str, text2: str) -> int:
      m, n = len(text1), len(text2)
      dp = [[0] * (n + 1) for _ in range(m + 1)]
      
      for i in range(1, m + 1):
          for j in range(1, n + 1):
              if text1[i - 1] == text2[j - 1]:
                  dp[i][j] = dp[i - 1][j - 1] + 1
              else:
                  dp[i][j] = max(dp[i - 1][j], dp[i][j - 1])
      
      return dp[m][n]