Longest Common Subsequence Between Sorted Arrays

Find the longest sequence of values that appears in both sorted arrays in order (respecting duplicates), i.e., the longest common subsequence between two sorted sequences. Because the inputs are sorted, the problem reduces to matching elements in order (typically via a merge/two‑pointer pattern) to compute the maximal common ordered subsequence.