Commit 5fc33c0

committed

Add a recursive version of the Longest Common Subsequence.

1 parent c9f1caf commit 5fc33c0Copy full SHA for 5fc33c0

File tree

+20

-20

lines changed

+20

-20

lines changed

Lines changed: 17 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,17 @@`
	`1`	`+import longestCommonSubsequence from '../longestCommonSubsequenceRecursive';`
	`2`	`+`
	`3`	`+describe('longestCommonSubsequenceRecursive', () => {`
	`4`	`+ it('should find longest common substring between two strings', () => {`
	`5`	`+ expect(longestCommonSubsequence('', '')).toBe('');`
	`6`	`+ expect(longestCommonSubsequence('ABC', '')).toBe('');`
	`7`	`+ expect(longestCommonSubsequence('', 'ABC')).toBe('');`
	`8`	`+ expect(longestCommonSubsequence('ABABC', 'BABCA')).toBe('BABC');`
	`9`	`+ expect(longestCommonSubsequence('BABCA', 'ABCBA')).toBe('ABCA');`
	`10`	`+ expect(longestCommonSubsequence('sea', 'eat')).toBe('ea');`
	`11`	`+ expect(longestCommonSubsequence('algorithms', 'rithm')).toBe('rithm');`
	`12`	`+ expect(longestCommonSubsequence(`
	`13`	`+ 'Algorithms and data structures implemented in JavaScript',`
	`14`	`+ 'Here you may find Algorithms and data structures that are implemented in JavaScript',`
	`15`	`+ )).toBe('Algorithms and data structures implemented in JavaScript');`
	`16`	`+ });`
	`17`	`+});`

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,17 +1,17 @@`
`1`	`1`	`/* eslint-disable no-param-reassign */`
`2`	`2`	`/**`
`3`		`- * Longest Common Substring (LCS) (Recursive Approach).`
	`3`	`+ * Longest Common Subsequence (LCS) (Recursive Approach).`
`4`	`4`	`*`
`5`	`5`	`* @param {string} string1`
`6`	`6`	`* @param {string} string2`
`7`	`7`	`* @return {number}`
`8`	`8`	`*/`
`9`		`-export default function longestCommonSubstringRecursive(string1, string2) {`
	`9`	`+export default function longestCommonSubsequenceRecursive(string1, string2) {`
`10`	`10`	`/**`
`11`	`11`	`*`
`12`	`12`	`* @param {string} s1`
`13`	`13`	`* @param {string} s2`
`14`		`- * @return {string} - returns the LCS (Longest Common Substring)`
	`14`	`+ * @return {string} - returns the LCS (Longest Common Subsequence)`
`15`	`15`	`*/`
`16`	`16`	`const lcs = (s1, s2, memo = {}) => {`
`17`	`17`	`if (!s1 \|\| !s2) return '';`