ConceptTheory & Algos
Longest common subsequence
The problem of finding the longest subsequence that is present in two given strings in the same relative order, but not necessarily contiguous.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
2Each in their own terms, from the easiest level.
Ryan O'Donnell
Erik Demaine
The problem of finding the longest sequence that can be obtained from two given sequences by deleting zero or more elements from each without changing the relative order of the remaining elements.
Connections
8The lectures that define it or assume it, and the concepts next to it.