class Solution {
public:
    int longestCommonSubsequence(string text1, string text2) {
        int n = text1.size();
        int m = text2.size();
        //int f[1010][1010] = {0};
        vector<vector<int>> f(1010,vector<int>(1010,0));
        for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
        {
            f[i][j] = max(f[i-1][j],f[i][j-1]);
            if(text1[i-1] == text2[j-1])
            f[i][j] = max(f[i][j],f[i-1][j-1]+1);
        }
        
        return f[n][m];
    }
};