title: Lcs Formed Consecutive Segments Least Length K
signature: lcsFormedConsecutiveSegmentsLeastLengthK :: Integer -> String -> String -> Integer
  lcsFormedConsecutiveSegmentsLeastLengthK k s1 s2 = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: Integer -> String -> String -> Integer -> String
  driver k s1 s2 expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME k s1 s2) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (4) ("aggayxysdfa") ("aggajxaaasdfa") (8) )
  
      printf "TEST-1...%s\n" (driver (2) ("55571659965107") ("390286654154") (2) )
  
      printf "TEST-2...%s\n" (driver (3) ("01011011100") ("0000110001000") (7) )
  
      printf "TEST-3...%s\n" (driver (5) ("aggasdfa") ("aggajasdfaxy") (5) )
  
      printf "TEST-4...%s\n" (driver (2) ("5710246551") ("79032504084062") (0) )
  
      printf "TEST-5...%s\n" (driver (3) ("0100010") ("10100000") (5) )
  
      printf "TEST-6...%s\n" (driver (3) ("aabcaaaa") ("baaabcd") (4) )
  
      printf "TEST-7...%s\n" (driver (1) ("1219") ("3337119582") (3) )
  
      printf "TEST-8...%s\n" (driver (2) ("111000011") ("011") (3) )
  
      printf "TEST-9...%s\n" (driver (2) ("wiC oD") ("csiuGOUwE") (0) )
  
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 ];
  }