Gfg_medium_Longest_Repeating_Subsequence.cpp

class Solution {
	public:
		int LongestRepeatingSubsequence(string str){
		    // Code here
		int n = str.length();
        if (n == 0) return 0;
        int longest = 0;
        vector<vector<int>> dp(n + 1, vector<int>(n + 1, 0));
 
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                if (str[i - 1] == str[j - 1] && i != j) {
                    dp[i][j] = 1 + dp[i - 1][j - 1];
                } else {
                    dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
                }
                longest = max(longest, dp[i][j]);
            }
        }
 
        return longest;
		}

};