title: Longest Repeating Subsequence
signature: func longestRepeatingSubsequence(str string) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(str string, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(str),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver("JxZFz", 0)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver("7648992235770", 3)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver("11100000", 6)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver("cRN  SgYjPsctJ", 1)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver("434", 1)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver("1", 0)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver("JRfZIAsbrPBZ", 1)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver("03779368305592", 3)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver("1111000", 5)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver("BkULuIi", 0)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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 ];
  }