REVENG03 - Editorial

PROBLEM LINK:

Practice

Contest

Author: Akshat Jain

Tester: Ankit Kathuria

Editorialist: Akshat Jain

DIFFICULTY:

EASY

PREREQUISITES:

Interest in Coding, Strings.

PROBLEM:

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.

QUICK EXPLANATION:

The task in this problem is to find the longest common subsequence in two strings provided.

EXPLANATION:

• 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.

//