/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

5 votes208 views2 answers
Array.prototype.map() expects a return value from arrow function array-callback-return react
TypeScript
1 vote226 views1 answer
Git check if its up to date
TypeScript
7 votes192 views3 answers
If temp table exists drop
TypeScript
1 vote181 views2 answers
.env typescript
TypeScript
0 vote226 views1 answer
TypeError: autodiscover_tasks() takes at least 2 arguments (1 given) celery
TypeScript
-1 vote221 views2 answers
Module '"@angular/fire/firestore"' has no exported member 'AngularFirestore'
TypeScript
0 vote217 views2 answers
Remove upsell products woocommerce
TypeScript
1 vote198 views1 answer
Typescript json.parse
TypeScript
1 vote226 views1 answer
Adoni db:seed
TypeScript
17 votes192 views3 answers
Router params angular
TypeScript