title: Longest Repeating Subsequence
signature: function longestRepeatingSubsequence($str) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($str, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($str), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        "JxZFz", 
        0));
      
      printf("TEST-1...%s\n",driver(
        "7648992235770", 
        3));
      
      printf("TEST-2...%s\n",driver(
        "11100000", 
        6));
      
      printf("TEST-3...%s\n",driver(
        "cRN  SgYjPsctJ", 
        1));
      
      printf("TEST-4...%s\n",driver(
        "434", 
        1));
      
      printf("TEST-5...%s\n",driver(
        "1", 
        0));
      
      printf("TEST-6...%s\n",driver(
        "JRfZIAsbrPBZ", 
        1));
      
      printf("TEST-7...%s\n",driver(
        "03779368305592", 
        3));
      
      printf("TEST-8...%s\n",driver(
        "1111000", 
        5));
      
      printf("TEST-9...%s\n",driver(
        "BkULuIi", 
        0));
      
  }
  
  main();
  ?>
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 ];
  }