title: Lcs Formed Consecutive Segments Least Length K
signature: func lcsFormedConsecutiveSegmentsLeastLengthK(k int, s1 string, s2 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(k int, s1 string, s2 string, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(k, s1, s2),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(4, 
  	"aggayxysdfa", 
  	"aggajxaaasdfa", 8)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(2, 
  	"55571659965107", 
  	"390286654154", 2)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(3, 
  	"01011011100", 
  	"0000110001000", 7)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(5, 
  	"aggasdfa", 
  	"aggajasdfaxy", 5)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(2, 
  	"5710246551", 
  	"79032504084062", 0)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(3, 
  	"0100010", 
  	"10100000", 5)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(3, 
  	"aabcaaaa", 
  	"baaabcd", 4)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(1, 
  	"1219", 
  	"3337119582", 3)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(2, 
  	"111000011", 
  	"011", 3)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(2, 
  	"wiC oD", 
  	"csiuGOUwE", 0)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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 ];
  }