title: Longest Repeating Subsequence
signature: fun longestRepeatingSubsequence(str: String): Int {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Int, expected:Int):Boolean{
    return actual.equals(expected)
  }
  fun driver(str: String, expected:Int):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(str), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver("JxZFz", 0)
      println("TEST-0...${result}")
      
      result = driver("7648992235770", 3)
      println("TEST-1...${result}")
      
      result = driver("11100000", 6)
      println("TEST-2...${result}")
      
      result = driver("cRN  SgYjPsctJ", 1)
      println("TEST-3...${result}")
      
      result = driver("434", 1)
      println("TEST-4...${result}")
      
      result = driver("1", 0)
      println("TEST-5...${result}")
      
      result = driver("JRfZIAsbrPBZ", 1)
      println("TEST-6...${result}")
      
      result = driver("03779368305592", 3)
      println("TEST-7...${result}")
      
      result = driver("1111000", 5)
      println("TEST-8...${result}")
      
      result = driver("BkULuIi", 0)
      println("TEST-9...${result}")
      
          
  }
  
  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 ];
  }