<gh_stars>0
#dynamic programing

# LCS
# input: 2 strings X = x1...xn, Y = y1...yn
# goal: find the length of longest string which is a subsequence of both x&y
# X = BCDBCDA
# y = ABECBAB
# LCS = BCBA, length of LCS = 4


'''

'''
#dynamic programing

# LCS
# input: 2 strings X = x1...xn, Y = y1...yn
# goal: find the length of longest string which is a subsequence of both x&y
# X = BCDBCDA
# y = ABECBAB
# LCS = BCBA, length of LCS = 4


'''

'''
#dynamic programing # LCS # input: 2 strings X = x1...xn, Y = y1...yn # goal: find the length of longest string which is a subsequence of both x&y # X = BCDBCDA # y = ABECBAB # LCS = BCBA, length of LCS = 4