• retagged by
1,172 views

1 Answer

Position:
Show:

Related questions

0 0 votes
2 answers 2 answers
3.3k
3.3k views
gmrishikumar asked Jan 22, 2019
3,334 views
Consider two strings A = "anandarmy" and B = "algorithms". Let ‘y’ be the length of the longest common subsequence (not necessarily contiguous) between A and B and let ‘x...
3 3 votes
1 1 answer
1.9k
1.9k views
Bongbirdie asked May 17, 2017
1,880 views
For finding longest common subsequence(LCS), standard sources mention that the recursive procedure consisting of the recursive tree occupies O(m+n) space( WITHOUT applyin...
2 2 votes
0 0 answers
1.5k
1.5k views
MiNiPanda asked Oct 24, 2017
1,513 views
Consider two strings A="pqqrr" and B="pqprqrp",let x be the length of the longest sub-sequence between A and B and let y be the number of such common sub-sequences betwee...