A word or string in which no character in the reversed string matches the character at the same position in the original string. In other words, for a string of length n, a total antipalindrome satisfies the condition that for every index i (1 ≤ i ≤ n), character i ≠ character n − i + 1.
It’s like the exact opposite of a palindrome—not even a single letter is allowed to line up with its mirror.
It’s like the exact opposite of a palindrome—not even a single letter is allowed to line up with its mirror.
"abcd" → reversed: "dcba" → no positions match → total antipalindrome
"abcdef" → reversed: "fedcba" → still no matching positions → total antipalindrome
"abca" → reversed: "acba" → the 'a' at the start matches → not a total antipalindrome
"racecar" → reversed: "racecar" → all mirror positions match → a palindrome; definitely not a total antipalindrome
"abcdef" → reversed: "fedcba" → still no matching positions → total antipalindrome
"abca" → reversed: "acba" → the 'a' at the start matches → not a total antipalindrome
"racecar" → reversed: "racecar" → all mirror positions match → a palindrome; definitely not a total antipalindrome
by Smakibbfb April 11, 2025
Get the Total Antipalindromemug.