1748: PalindromeFactory

A palindrome is a string that reads the same forward and backward. Not all strings are palindromes and we are going to fix that. In this problem we consider four edit operations: 1.Insert a character at any position of a string (including the beginning and the end) 2.Delete a character at any position of a string 3.Change a character at any position of a string 4.Swap any two different characters (not necessarily adjacent) You can apply the first three operations any number of times, but the last operation can be applied at most once. You are given a string initial. Return the minimal number of operations needed to make a palindrome from it.

Each line a initial string

Each line a number means the minimal number of operations.

abba
babacvabba
abc

0
2
1