Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Algorithm Design Techniques Dynamic Programming
Consider the following two sequences :
X = < B, C, D, C, A, B, C >
and Y = < C, A, D, B, C, B >
The length of longest common subsequence of X and Y is :
1
5
2
3
3
4
4
2