def longestCommonSubsequence(self, text1: str, text2: str)
        #Tabulation Approach
        if len(text1)==0 or len(text2)==0:
            return 0
        rows,columns=(len(text2)+1,len(text1)+1)
        dp = [[0 for j in range(columns)] for i in range(rows)]
        for col in range(1,columns):
            for row in range(1,rows):
                if text1[col-1]==text2[row-1]:
                    dp[row][col]=1+dp[row-1][col-1]
                else:
                    dp[row][col]=max(dp[row-1][col],dp[row][col-1])
        return dp[rows-1][columns-1]

Lottery Winner ✅(Python 3)