logo CodeStepByStep logo

longestCommonSubsequence

Language/Type: C++ recursion backtracking Lexicon
Related Links:
Author: Marty Stepp (on 2016/08/27)

Write a recursive function named longestCommonSubsequence that returns the longest common subsequence of two strings. Recall that if a string is a subsequence of another, each of its letters occurs in the longer string in the same order, but not necessarily consecutively. For example, the following calls should return the following values:

Call Return
longestCommonSubsequence("marty", "megan") "ma"
longestCommonSubsequence("hannah", "banana") "anna"
longestCommonSubsequence("she sells", "seashells") "sesells"
longestCommonSubsequence("janet", "cs106b") ""

Do not use any loops. Your function must be recursive.

Type your solution here:


This is a function problem. Write a C++ function as described. Do not write a complete program; just the function(s) above.

You must log in before you can solve this problem.


Log In

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.

© Marty Stepp, all rights reserved.