Files
freeCodeCamp/curriculum/challenges/arabic/10-coding-interview-prep/rosetta-code/longest-common-subsequence.md
2022-10-20 09:13:17 -07:00

97 lines
2.1 KiB
Markdown

---
id: 5e6dd1278e6ca105cde40ea9
title: Longest common subsequence
challengeType: 1
forumTopicId: 385271
dashedName: longest-common-subsequence
---
# --description--
The **longest common subsequence** (or **LCS**) of groups A and B is the longest group of elements from A and B that are common between the two groups and in the same order in each group. For example, the sequences `1234` and `1224533324` have an LCS of `1234`:<u>1234</u>
<u>12</u>245<u>3</u>332<u>4</u>
For a string example, consider the sequences `thisisatest` and `testing123testing`. An LCS would be `tsitest`:
<u>t</u>hi<u>si</u>sa<u>test</u>
<u>t</u>e<u>s</u>t<u>i</u>ng123<u>test</u>ing.
Your code only needs to deal with strings.
# --instructions--
Write a case-sensitive function that returns the LCS of two strings. You don't need to show multiple LCS's.
# --hints--
`lcs` should be a function.
```js
assert(typeof lcs == 'function');
```
`lcs("thisisatest", "testing123testing")` should return a string.
```js
assert(typeof lcs('thisisatest', 'testing123testing') == 'string');
```
`lcs("thisisatest", "testing123testing")` should return `"tsitest"`.
```js
assert.equal(lcs('thisisatest', 'testing123testing'), 'tsitest');
```
`lcs("ABCDGH", "AEDFHR")` should return `"ADH"`.
```js
assert.equal(lcs('ABCDGH', 'AEDFHR'), 'ADH');
```
`lcs("AGGTAB", "GXTXAYB")` should return `"GTAB"`.
```js
assert.equal(lcs('AGGTAB', 'GXTXAYB'), 'GTAB');
```
`lcs("BDACDB", "BDCB")` should return `"BDCB"`.
```js
assert.equal(lcs('BDACDB', 'BDCB'), 'BDCB');
```
`lcs("ABAZDC", "BACBAD")` should return `"ABAD"`.
```js
assert.equal(lcs('ABAZDC', 'BACBAD'), 'ABAD');
```
# --seed--
## --seed-contents--
```js
function lcs(a, b) {
}
```
# --solutions--
```js
function lcs(a, b) {
var aSub = a.substring(0, a.length - 1);
var bSub = b.substring(0, b.length - 1);
if (a.length === 0 || b.length === 0) {
return '';
} else if (a.charAt(a.length - 1) === b.charAt(b.length - 1)) {
return lcs(aSub, bSub) + a.charAt(a.length - 1);
} else {
var x = lcs(a, bSub);
var y = lcs(aSub, b);
return (x.length > y.length) ? x : y;
}
}
```