Freaks City

Problem Definition Given $n$ strings $T_1, T_2, \dots, T_n$, each of length $len$. Define $f(a, b)$ as the minimum number of sorting operations required on substrings of $a$ to make it identical to $b$. If it is impossible to transform $a$ into $b$ via substring sorting, $f(a, b) = 1337$. The objective is to compute: Analysis of Function Value ...