Skip to Content
Learning JavaScript Data Structures and Algorithms - Third Edition
book

Learning JavaScript Data Structures and Algorithms - Third Edition

by Loiane Avancini
April 2018
Beginner to intermediate content levelBeginner to intermediate
426 pages
10h 19m
English
Packt Publishing
Content preview from Learning JavaScript Data Structures and Algorithms - Third Edition

The longest common subsequence

Another DP problem that is very often used in programming challenge problems is the longest common subsequence (LCS). This problem consists of finding the length of the longest sub­sequence in two string sequences. The longest subsequence is a sequence that appears in the same relative order but is not necessarily contiguous (not a substring) in both strings.

Consider the following example:

Now, let's take a look at the following algorithm:

function lcs(wordX, wordY) {  const m = wordX.length;  const n = wordY.length;  const l = [];  for (let i = 0; i <= m; i++) {    l[i] = []; // {1} for (let j = 0; j <= n; j++) { ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Learning JavaScript Data Structures and Algorithms

Learning JavaScript Data Structures and Algorithms

Loiane Avancini

Publisher Resources

ISBN: 9781788623872Supplemental Content