Talk:Longest palindromic substrings: Difference between revisions
Content added Content deleted
m (→maybe specify a list of strings to be used for this task: added a new talk section.) |
|||
Line 25:
How should duplicate palindromes substrings be handled? Should each palindromic string be shown or duplicates weeded out? -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 17:38, 28 September 2020 (UTC)
== stretch goal ==
The longest palindromes in the first 10,000dp of pi sounded like a fair challenge! --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 00:20, 29 September 2020 (UTC)
|
Revision as of 00:21, 29 September 2020
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)
stretch goal
The longest palindromes in the first 10,000dp of pi sounded like a fair challenge! --Pete Lomax (talk) 00:20, 29 September 2020 (UTC)