Talk:Longest palindromic substrings

From Rosetta Code
Revision as of 00:45, 29 September 2020 by Petelomax (talk | contribs) (Undo revision 313027 by Petelomax (talk))
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

the longest palindromic substring for Roman orators

Is it the substrings:

 longest palindromic substrings for string:  Cicero
────────────────────────────────────────────────────
    (length=1)    C
    (length=1)    i
    (length=1)    c
    (length=1)    e
    (length=1)    r
    (length=1)    o

Should the palindromes be case sensitive, and should one character palindromes be listed (if that is the case)?     -- Gerard Schildberger (talk) 17:03, 28 September 2020 (UTC)


maybe specify a list of strings to be used for this task

It might be helpful for the task to specify a list of strings to be used for this task   (maybe such as the strings that the   Phix   entry used).     -- Gerard Schildberger (talk) 17:13, 28 September 2020 (UTC)


the handling of duplicate palindromes substrings

How should duplicate palindromes substrings be handled?     Should each palindromic string be shown or duplicates weeded out?     -- Gerard Schildberger (talk) 17:38, 28 September 2020 (UTC)