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

  • shreyavishwalin1
     + 0 comments

    My Solution in Python 3

    def commonChild(s1, s2):
    n = len(s1)
    m = len(s2)
    
    # Initialize dp array
    dp = [[0] * (m + 1) for _ in range(n + 1)]
    
    # Build dp array
    for i in range(1, n + 1):
        for j in range(1, m + 1):
            if s1[i - 1] == s2[j - 1]:
                dp[i][j] = dp[i - 1][j - 1] + 1
            else:
                dp[i][j] = max(dp[i - 1][j], dp[i][j - 1])
    
    # The length of the longest common child
    return dp[n][m]