title: Lcs Formed Consecutive Segments Least Length K
signature: fun lcsFormedConsecutiveSegmentsLeastLengthK(k: Int, s1: String, s2: 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(k: Int, s1: String, s2: String, expected:Int):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(k, s1, s2), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(4, "aggayxysdfa", "aggajxaaasdfa", 8)
      println("TEST-0...${result}")
      
      result = driver(2, "55571659965107", "390286654154", 2)
      println("TEST-1...${result}")
      
      result = driver(3, "01011011100", "0000110001000", 7)
      println("TEST-2...${result}")
      
      result = driver(5, "aggasdfa", "aggajasdfaxy", 5)
      println("TEST-3...${result}")
      
      result = driver(2, "5710246551", "79032504084062", 0)
      println("TEST-4...${result}")
      
      result = driver(3, "0100010", "10100000", 5)
      println("TEST-5...${result}")
      
      result = driver(3, "aabcaaaa", "baaabcd", 4)
      println("TEST-6...${result}")
      
      result = driver(1, "1219", "3337119582", 3)
      println("TEST-7...${result}")
      
      result = driver(2, "111000011", "011", 3)
      println("TEST-8...${result}")
      
      result = driver(2, "wiC oD", "csiuGOUwE", 0)
      println("TEST-9...${result}")
      
          
  }
  
  main()
source_py: def lcs_formed_consecutive_segments_least_length_k(k, s1, s2):
      n = len(s1)
      m = len(s2)
      lcs = [[0 for x in range((m + 1))] for y in range((n + 1))]
      cnt = [[0 for x in range((m + 1))] for y in range((n + 1))]
      for i in range(1, (n + 1)):
          for j in range(1, (m + 1)):
              lcs[i][j] = max(lcs[(i - 1)][j], lcs[i][(j - 1)])
              if (s1[(i - 1)] == s2[(j - 1)]):
                  cnt[i][j] = (cnt[(i - 1)][(j - 1)] + 1)
              if (cnt[i][j] >= k):
                  for a in range(k, (cnt[i][j] + 1)):
                      lcs[i][j] = max(lcs[i][j], (lcs[(i - a)][(j - a)] + a))
      return lcs[n][m]
source_cpp: int lcs_formed_consecutive_segments_least_length_k(int k, string s1, string s2) {
    int n = s1 . length ( );
    int m = s2 . length ( );
    int lcs [ n + 1 ] [ m + 1 ];
    int cnt [ n + 1 ] [ m + 1 ];
    memset ( lcs, 0, sizeof ( lcs ) );
    memset ( cnt, 0, sizeof ( cnt ) );
    for ( int i = 1;
    i <= n;
    i ++ ) {
      for ( int j = 1;
      j <= m;
      j ++ ) {
        lcs [ i ] [ j ] = max ( lcs [ i - 1 ] [ j ], lcs [ i ] [ j - 1 ] );
        if ( s1 [ i - 1 ] == s2 [ j - 1 ] ) cnt [ i ] [ j ] = cnt [ i - 1 ] [ j - 1 ] + 1;
        if ( cnt [ i ] [ j ] >= k ) {
          for ( int a = k;
          a <= cnt [ i ] [ j ];
          a ++ ) lcs [ i ] [ j ] = max ( lcs [ i ] [ j ], lcs [ i - a ] [ j - a ] + a );
        }
      }
    }
    return lcs [ n ] [ m ];
  }