title: Longest Repeated Subsequence 1
signature: class Solution {
  
      public string LongestRepeatedSubsequence1(string str) {
test_code: using System;
  using System.Numerics;
  using System.Diagnostics;
  using System.Collections.Generic;
  using System.Linq;
  using System.Text;
  using System.Security.Cryptography;
  using System.Web.UI;
  using System.Web.Script.Serialization;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  namespace EvaluatePrediction {
      class TestRunner {
          public bool ValidateSolution(string actual, string expected){
              return new JavaScriptSerializer().Serialize(actual) == new JavaScriptSerializer().Serialize(expected);
          }
  
          public string driver(string str, string expected){
              try{
                PLACEHOLDER_CLS_NAME solution_cls = new PLACEHOLDER_CLS_NAME();
                string pred_result = solution_cls.PLACEHOLDER_FN_NAME(str); 
                if (ValidateSolution(
                      pred_result,
                      expected)){
                  return "PASSED";
                }
                return "FAILED";
              } 
              catch (Exception exception_obj)
              {
                return exception_obj.GetType().FullName;
              }
          }
          static void Main(string[] args) {
              TestRunner runner = new TestRunner();
              String result;
              result = runner.driver(
                  "qnQxjoRx", 
                  "x"
              );
              Console.WriteLine(string.Format(
                  "TEST-0...{0}",
                  result)
              );result = runner.driver(
                  "27473733400077", 
                  "7733007"
              );
              Console.WriteLine(string.Format(
                  "TEST-1...{0}",
                  result)
              );result = runner.driver(
                  "000010111111", 
                  "0000111111"
              );
              Console.WriteLine(string.Format(
                  "TEST-2...{0}",
                  result)
              );result = runner.driver(
                  "TNVwgrWSLu", 
                  ""
              );
              Console.WriteLine(string.Format(
                  "TEST-3...{0}",
                  result)
              );result = runner.driver(
                  "9537", 
                  ""
              );
              Console.WriteLine(string.Format(
                  "TEST-4...{0}",
                  result)
              );result = runner.driver(
                  "1100", 
                  "10"
              );
              Console.WriteLine(string.Format(
                  "TEST-5...{0}",
                  result)
              );result = runner.driver(
                  "lYcoiQfzN", 
                  ""
              );
              Console.WriteLine(string.Format(
                  "TEST-6...{0}",
                  result)
              );result = runner.driver(
                  "52", 
                  ""
              );
              Console.WriteLine(string.Format(
                  "TEST-7...{0}",
                  result)
              );result = runner.driver(
                  "00100001100", 
                  "0000010"
              );
              Console.WriteLine(string.Format(
                  "TEST-8...{0}",
                  result)
              );result = runner.driver(
                  "Rkxe", 
                  ""
              );
              Console.WriteLine(string.Format(
                  "TEST-9...{0}",
                  result)
              );
          }
      }
  }
  
source_py: def longest_repeated_subsequence_1(str):
      n = len(str)
      dp = [[0 for i in range((n + 1))] for j in range((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])
      res = ''
      i = n
      j = n
      while ((i > 0) and (j > 0)):
          if (dp[i][j] == (dp[(i - 1)][(j - 1)] + 1)):
              res += str[(i - 1)]
              i -= 1
              j -= 1
          elif (dp[i][j] == dp[(i - 1)][j]):
              i -= 1
          else:
              j -= 1
      res = ''.join(reversed(res))
      return res
source_cpp: string longest_repeated_subsequence_1(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 ] );
    string res = "";
    int i = n, j = n;
    while ( i > 0 && j > 0 ) {
      if ( dp [ i ] [ j ] == dp [ i - 1 ] [ j - 1 ] + 1 ) {
        res = res + str [ i - 1 ];
        i --;
        j --;
      }
      else if ( dp [ i ] [ j ] == dp [ i - 1 ] [ j ] ) i --;
      else j --;
    }
    reverse ( res . begin ( ), res . end ( ) );
    return res;
  }