/TypeScript/Common child hackerrank solution

Common child hackerrank solution

def commonChild(s1, s2):
    m = [[0]*(len(s2)+1) for _ in range(len(s1)+1)]
    for i,c in enumerate(s1,1):
        for j,d in enumerate(s2,1):
            if c == d:
                m[i][j] = m[i-1][j-1]+1
            else:
                m[i][j] = max(m[i][j-1],m[i-1][j])
                   
    return m[-1][-1]
print(commonChild(input(), input()))

Source: thepoorcoder.com

Similar codes

-1 vote125 views1 answer
Alert cannot operate on nodes the current scene inherits from
TypeScript
2 votes146 views2 answers
Js find all string occurrences
TypeScript
0 vote120 views1 answer
How to find matching brackets in eclipse
TypeScript
1 vote130 views2 answers
Ts lint ignore next line
TypeScript
1 vote133 views1 answer
Serenity conditional formatting grid row
TypeScript
1 vote129 views1 answer
Get posts from selected taxonomy
TypeScript
7 votes125 views2 answers
How to fix from PyQt5 import QtWebEngineWidgets error
TypeScript
0 vote132 views1 answer
Roots of grass
TypeScript
0 vote154 views1 answer
Why table columns are messing in one another in angular
TypeScript
12 votes162 views4 answers
Google fonts poppins
TypeScript