title: Longest Repeating Subsequence
signature: longestRepeatingSubsequence(str) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(str, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(str), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          "JxZFz", 
          0)
      }");
  
      print("TEST-1...${driver(
          "7648992235770", 
          3)
      }");
  
      print("TEST-2...${driver(
          "11100000", 
          6)
      }");
  
      print("TEST-3...${driver(
          "cRN  SgYjPsctJ", 
          1)
      }");
  
      print("TEST-4...${driver(
          "434", 
          1)
      }");
  
      print("TEST-5...${driver(
          "1", 
          0)
      }");
  
      print("TEST-6...${driver(
          "JRfZIAsbrPBZ", 
          1)
      }");
  
      print("TEST-7...${driver(
          "03779368305592", 
          3)
      }");
  
      print("TEST-8...${driver(
          "1111000", 
          5)
      }");
  
      print("TEST-9...${driver(
          "BkULuIi", 
          0)
      }");
  
      return 0;
  }
source_py: def longest_repeating_subsequence(str):
      n = len(str)
      dp = ([([0] * (n + 1))] * (n + 1))
      for i in range(1, (n + 1)):
          for j in range(1, (n + 1)):
              if ((str[(i - 1)] == str[(j - 1)]) and (i != j)):
                  dp[i][j] = (1 + dp[(i - 1)][(j - 1)])
              else:
                  dp[i][j] = max(dp[i][(j - 1)], dp[(i - 1)][j])
      return dp[n][n]
source_cpp: int longest_repeating_subsequence(string str) {
    int n = str . length ( );
    int dp [ n + 1 ] [ n + 1 ];
    for ( int i = 0;
    i <= n;
    i ++ ) for ( int j = 0;
    j <= n;
    j ++ ) dp [ i ] [ j ] = 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 ] [ j - 1 ], dp [ i - 1 ] [ j ] );
      }
    }
    return dp [ n ] [ n ];
  }