Minimum string moves

We have two strings A and B which are permutations of the same set of characters. We need to change these strings to obtain two identical strings by performing  the following operations:   swap two consecutive characters of a string   swap the first and the last characters of a string The operation can be […]

Continue Reading

String Similarity

For two strings A and B, we define the similarity of the strings to be the length of the longest prefix common to both strings. For example, the similarity of strings “abc” and “abd” is 2, while the similarity of strings “aaa” and “aaab” is 3. Calculate the sum of similarities of a string S […]

Continue Reading