Converese Palindrome

As you are the aware of palindrome of a string. A string $S$ of length $n$ is said to be a palindrome if $S_i$ = $S_{n-i-1}$ for every $0 \leq i \lt n$. Here the converse of lower case alphabets is defined as: - converse of a is z - converse of b is y - and so on... (converse of z is a). A string $S$ of length $n$ is said to be converse palindrome if $S_i$ = converse ($S_{n-i-1}$) for every $0 \