Make String Anti-palindrome

Given a string, transform it into an anti-palindrome (s[i] != s[n-1-i] for all i) using the minimum number of character replacements (or report impossibility). Key points: odd-length strings are impossible, only symmetric pairs matter, and the problem reduces to balancing character frequencies across pairs — often solved with greedy counting or assignment/flow techniques.