0 votes 0 votes closed as a duplicate of: MadeEasy Test Series: Algorithms - Dynamic Programming Consider two strings A = “abbaccda” and B = “abcaa” consider "x"be length of the longest common subsequence between A and B and “y” be the number of distinct such longest common subsequences between A and B. Then 10x + 2y is ________. talha hashim asked Aug 1, 2018 closed Aug 1, 2018 by srestha talha hashim 263 views comment Share Follow See 1 comment See all 1 1 comment reply Shaik Masthan commented Aug 1, 2018 reply Follow Share Close this question... you mistakenly post it twice 0 votes 0 votes Please log in or register to add a comment.