Page Contents
Double String Concatenation Solution
You are given a string s. In one operation, you can remove, insert or update any character in s. Return the minimum number of operations required such that s = t + t for any t.
Constraints
n ≤ 100 where n is the length of s
Example 1
Input
s = “abczbdc”
Output
2
Explanation
If we replace the “z” to “a” and r
