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"


eg.2

input: "3333"
output: "33", "333", "3333"
J, 24 31 40

~.(#~(1&lt;#*]-:|.)&amp;&gt;),&lt;\\.


Sample use:

   ~.(#~(1&lt;#*]-:|.)&amp;&gt;),&lt;\\. '12131331'
┌───┬───┬───┬────┬──┐
│121│131│313│1331│33│
└───┴───┴───┴────┴──┘
   ~.(#~(1&lt;#*]-:|.)&amp;&gt;),&lt;\\. '3333'
┌──┬───┬────┐
│33│333│3333│
└──┴───┴────┘


Take that, GolfScript!