Counting the number of continuous palindromic substrings – codereview.stackexchange.com

Counting the number of continuous palindromic substrings – codereview.stackexchange.com

02:58 No Comments
Given a string of lowercase ASCII characters, find all distinct continuous palindromic sub-strings of it. Here is my code: def palindrome(s): if s==s[::-1]: return True ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Unknown

Artikel Terkait

0 Comment to "Counting the number of continuous palindromic substrings – codereview.stackexchange.com"

Post a Comment

Subscribe to: Post Comments (Atom)