/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

0 vote101 views1 answer
Formgroup reset values
TypeScript
6 votes110 views3 answers
Mongodb count based on array of ids
TypeScript
0 vote107 views1 answer
Elements without corner css
TypeScript
18 votes113 views2 answers
Fluttter http get
TypeScript
0 vote123 views1 answer
Dynamic index in typescript
TypeScript
0 vote108 views1 answer
1.Load the data set cats from the library MASS
TypeScript
1 vote119 views1 answer
Size of list applescript
TypeScript
0 vote96 views2 answers
Angular start date end date validation
TypeScript
0 vote120 views1 answer
Push array elements if not exists mongoose
TypeScript
7 votes111 views5 answers
Reactnative typescript
TypeScript