The palindrome tag has no wiki summary.
19
votes
21answers
2k views
Shortest code to determine if a string is a palindrome
A palindrome is some string that is spelled the same way both backwards and forwards. For instance, 'Eva, can I stab bats in a cave?' is a palindrome (EVACANISTAB | BATSINACAVE)
For this code golf, ...
-2
votes
2answers
483 views
Conversion to palindrome with minimal points used
Input: a word (2-100 characters)
Convert this word to a palindrome:
delete character - 13 points
add character - 12 points
increase character - 5 points ('d' > 'e')
decrease character - 4 points ...
15
votes
11answers
1k views
Palindromic palindrome checker
Write a program to test if a string is palindromic, with the added condition that the program be palindromic itself.
6
votes
9answers
469 views
Make a number palindrome
Write a function that takes a number as an argument and makes it a palindrome by appending minimum number of digits. The number will be at max of 100 digits.
Sample Inputs
12
232
2323
1012121
Sample ...
2
votes
2answers
167 views
Finding “sub-palindromes” 2: subsequences.
The same task as Finding "sub-palindromes" but instead of finding substrings you must find subsequences that are not substrings.
eg1:
input: "12131331"
output:
"11", "33", "111", "121", "131", ...
13
votes
15answers
911 views
Finding “sub-palindromes”.
The shortest code that finds all unique "sub-palindromes" of a string, that is: any substring with length > 1 that is a palindrome.
eg.1
input: "12131331"
output: "33", "121", "131", "313", "1331"
...
12
votes
19answers
1k views
196 algorithm code golf.
Write a short program for 196-algorithm.
The algorithm starts from an integer, then adds its reverse to it until a palindrome is reached.
e.g.
input = 5280
5280 + 0825 = 6105
6105 + 5016 = 11121
...
