Hellishly Fast Common Subsequence#5473
Given two strings consisting of zeros and ones, find the length of their longest common subsequence.
Two strings are given, each of length no more than .
Output a single number — the length of their longest common subsequence.
Example 1