13
3
Your task is to palindromize a string as follows:
Take the string.
abcde
Reverse it.
edcba
Remove the first letter.
dcba
Glue it onto the original string.
abcdedcba
But here's the catch: since this challenge is about palindromes, your code itself also has to be a palindrome.
Remember, this is code-golf, so the code with the smallest number of bytes wins.
1There should be a hefty bonus for any code that does not use comments to fulfill the palindrome requirement. – Theo – 2016-11-03T02:14:45.217
@Theo Then it would go straight to the golf-langs with the palindrome builtin. I don't really see the need for it, and doing it without a comment is more of a personal challenge. – miles – 2016-11-03T02:25:40.943
@miles Fair enough. Although I would love to see some creativity from the non-golfing-langs in general. – Theo – 2016-11-03T02:28:14.680
Related. – xnor – 2016-11-03T07:53:21.673
@miles It´s virtually impossible for non-eso-langs to do this without a comment. You can´t just palindromize predefined function names. Maybe it can be done, but it would ridiculously blow up the size. – Titus – 2016-11-03T09:56:35.150
Can there be an exception for the program to substitute exact characters for mirrored characters in its palindrome? I.e. Allowing "(1+1)" as a palindrome. I think it would increase the competitiveness of non-golf languages. – None – 2016-11-03T13:22:58.230
8Actually, it´s not an exact duplicate. You have to remove one character from the input here. – Titus – 2016-11-03T14:23:58.790