Question

How to find the length of longest common subsequence (LCS) present in two strings with Python

Answer 1

def lcs(s1, s2, s1_len, s2_len):
    if s1_len == 0 or s2_len == 0:
        return 0
    elif s1[s1_len - 1] == s2[s2_len - 1]:
        return 1 + lcs(s1, s2, s1_len - 1, s2_len - 1)
    else:
        return max(lcs(s1, s2, s1_len, s2_len - 1), lcs(s1, s2, s1_len - 1, s2_len))


s1 = "accyrb"
s2 = "cyxyazb"

print("The length of LCS is:", lcs(s1 , s2, len(s1), len(s2)))


'''
run:

The length of LCS is: 3

'''

 

70+ SQL courses for beginners and professionals