Challenge: Longest Common Subsequence of Two Sequences

Problem

---

Longest Common Subsequence of Two Sequences Problem

Compute the longest common subsequence of two sequences.

Input: Two sequences.

Output: Their longest common subsequence.

---

Given two sequences $A$ = ($a_{1}$, $a_{2}$,…, $a_{n}$) and $B$ = ($b_{1}$, $b_{2}$,…, $b_{m}$), find the length of their longest common subsequence, i.e., the largest non-negative integer $p$ such that there exist indices

$$$$ ...