We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Strings
  4. Common Child
  5. Discussions

Common Child

Sort 615 Discussions, By:

  • hackerrank931
     + 0 comments

    Kotlin solution

    fun commonChild(s1: String, s2: String): Int {
    
    val table = Array<Array<Int>>(s2.length + 1){Array<Int>(s1.length + 1){0}}
    
    for (i in 1..s1.length) {
        for(j in 1..s2.length) {
            table[i][j] = if (s1[i-1] == s2[j-1]) 1 + table[i-1][j-1]
                else Math.max(table[i][j-1], table[i-1][j])
        }
    }
    
    return(table[s1.length][s2.length])
}

  • hamidrb
     + 0 comments

    Here is code Working with pyp3 ,whereas Time limit by python3:

        m = len(s1)
    n = len(s2)
    # 2D Array m*n
    counter = [[0] * (n + 1) for x in range(m + 1)]
    longest = 0

    for i in range(m):
        for j in range(n):
            if s1[i] == s2[j]:
                c = counter[i][j] + 1
                counter[i + 1][j + 1] = c
                if c > longest:
                    longest = c
            else:
                counter[i + 1][j + 1] = max(counter[i + 1][j], counter[i][j + 1])
    return longest

  • owaiskorejo
     + 0 comments

    C++ Based on this article: https://en.wikipedia.org/wiki/Longest_common_subsequence_problem

    int commonChild(string s1, string s2) {
    int n = s1.length(), m = s2.length();
    vector<vector<int>> arr(n+1,vector<int>(m+1));
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            if(s1[i-1] == s2[j-1]){
                arr[i][j] = arr[i-1][j-1] + 1;
            }
            else{
                arr[i][j] = max(arr[i-1][j], arr[i][j-1]);
            }
        }
    }
    return arr[m][n];
}

  • psshukla02
     + 1 comment

    def commonChild(s1, s2):

    m = [[0]*(len(s1)+1)]*(len(s1)+1)

for i in range(0,len(s1)):
    for j in range(0,len(s1)):
        if s1[i] == s2[j]:
            m[i+1][j+1] = max(m[i][j],m[i][j])+1
        else:
            m[i+1][j+1] = max(m[i][j+1],m[i+1][j]) 
print(m)  
return m[len(s1)][len(s1)] 

    need help with the code, Solved via dynamic programming idk whats wrng

  • GautaM__24
     + 0 comments

    Why my this code is wrong ? Can someone give me small test cases , it will be a huge help .

    public static int commonChild(String s1, String s2) {
    
        int max = -1 ; 

        for(int i = 0 ; i < s1.length() ; i++){
            int count = 0 ; int len = 0 ;
            for(int j = i ; j < s1.length() ; j++){
                for(int k = len ; k < s2.length() ; k++){
                    if(j >= s1.length())
                        break ;
                    if(s1.charAt(j) == s2.charAt(k)){
                        len = k + 1 ;
                        j++ ;
                        count++ ;
                    }
                }
            }
            if(count > max)
                max = count ;
        }
        
        return max ;
    }
Load more conversations