/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

2 votes232 views2 answers
Valid jwt
TypeScript
0 vote238 views2 answers
Discord.js stats command
TypeScript
0 vote271 views1 answer
Css how to make a elements of same type start at same height
TypeScript
0 vote222 views2 answers
Field set salesforce
TypeScript
4 votes244 views2 answers
When to do manual testing
TypeScript
0 vote221 views1 answer
Display only user contributor comments wordpress
TypeScript
1 vote260 views1 answer
Round up number typescript
TypeScript
0 vote245 views1 answer
Typescript optional property
TypeScript
0 vote237 views1 answer
Whats my name
TypeScript
2 votes258 views1 answer
Python remove folder recursively
TypeScript