MathDB

Two 100-digit binary sequences are given. In one operation, one may insert (possibly at the beggining or end) or remove one or more identical digits from a sequence. What is the smallest

k{}

for which we can transform the first sequence into the second one in no more than

k{}

operations?
Proposed by V. Novikov

Problem Statement