Consider the strings “PQRSTPQRS” and “PRATPBRQRPS”. What is the length of the longest common subsequence?

M

Mr. Dubey

🎓 Coach ⭐ 104.48K Points

📊 Design and Analysis of Algorithms

Q. Consider the strings “PQRSTPQRS” and “PRATPBRQRPS”. What is the length of the longest common subsequence?

(A) 9
(B) 8
(C) 7
(D) 6

💬 Discuss

✅ Correct Answer: (C) 7

Explanation: the longest common subsequence is “prtpqrs” and its length is 7.

Explanation by: Mr. Dubey

the longest common subsequence is “prtpqrs” and its length is 7.

💬 Discussion

📊 Question Analytics

👁️

258

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

81%

Success Rate