0 votes 0 votes Consider two strings P = ‘10010101’ and Q = ‘010110110’. Let j be the length of the longest common subsequence between P and Q. The minimum no. of elements need to be skipped to obtain LCS of length j is _______. I am getting 2 but the ans is 3.. anjali007 asked Dec 23, 2018 anjali007 1.2k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Shaik Masthan commented Dec 23, 2018 reply Follow Share LCS = 001010 to get in P = 10010101 ----> skip,choose,choose,choose,choose,choose,choose,skip ===> 2 to get in Q = 010110110 ----> choose,skip,choose,choose,skip,choose,choose,skip,choose ==> 3 it doesn't specify from P you have to derive LCS, or from Q, then minimum = max(2,3) = 3 1 votes 1 votes anjali007 commented Dec 23, 2018 reply Follow Share @Shaik Masthan I thought minimum meant 2 .. thanks for clarifying 0 votes 0 votes Please log in or register to add a comment.
