/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 vote102 views1 answer
Slice string into segments of 2 characters
TypeScript
1 vote106 views2 answers
Check if url exists python
TypeScript
0 vote65 views1 answer
Lists - Learn C#
TypeScript
0 vote101 views1 answer
Ex term 15
TypeScript
0 vote110 views1 answer
How to update objects in locall storage
TypeScript
0 vote110 views1 answer
Interface extending mongoose document object does not contain _doc object typescript
TypeScript
7 votes121 views5 answers
Cannot be loaded because running scripts is disabled on this system vscode
TypeScript
0 vote100 views1 answer
Typescript isvalidguid
TypeScript
10 votes118 views1 answer
Keras cheatsheets pdfs
TypeScript
1 vote108 views1 answer
How to print the results of a command in a fil in linux
TypeScript