Author: Akshat Jain
Tester: Ankit Kathuria
Editorialist: Akshat Jain
Interest in Coding, Strings.
Finding the problem is the first task based on the input, output format and exe file provided. Then think the logic and code the same.
The task in this problem is to find the longest common subsequence in two strings provided.
• The first input is the number of test cases.
• The next 2 lines are the 2 strings to find LCS from.
• Finally the longest common subsequence must be displayed.
AUTHOR’S AND TESTER’S SOLUTIONS:
Author’s solution can be found here.
Tester’s solution can be found here.