How to find the biggest symmetric word using Python in quick way?

Question

I have a text like this:

a ab aba bob dod doood zoroz rar goog bnb

and I want to find the biggest symmetric word in this text. How can I do it?

I'm looking for the fastest way possible.

If you block on spaces then this is the same problem as https://en.wikipedia.org/wiki/Longest_palindromic_substring. — Kent Shikama, Dec 07 '19 at 07:29
I imagine the problem is significantly easier with already made potential palindromes ;P — Joran Beasley, Dec 07 '19 at 07:29

score 1 · Answer 1 · answered Dec 07 '19 at 07:31

Since I don't want to hand over the entire code to you, let me break it down :

Break the sentence down into a list of words 
Initialise a variable to hold the maximum length of the pallindrome (maxlen = 0)
Initialise a variable to hold the word with this lenght ( result = "" )
For word in list :
    if word is a pallindrome and length(word) > maxlen
        maxlen = length(word)
        result = word

accdias · Answer 2 · 2019-12-07T07:42:14.917

0

Something like this will do it:

Python 3.7.5 (default, Oct 17 2019, 12:16:48) 
[GCC 9.2.1 20190827 (Red Hat 9.2.1-1)] on linux
Type "help", "copyright", "credits" or "license" for more information.
>>> words = 'a ab aba bob dod doood zoroz rar goog bnb'
>>> max((word for word in words.split() if word == word[::-1]), key=len)
'doood'
>>>

edited Dec 07 '19 at 07:42

answered Dec 07 '19 at 07:36

accdias

5,160
3
19
31

What if my text looks like this? text="abaroorppooppwooow" How can I find the biggest one without split function? – Keivan Dec 07 '19 at 07:49
2

so your problem is totally different than what you posted .... – Joran Beasley Dec 07 '19 at 07:53
@user3194835 I suggest you first google for "longest palindrome in a string" – Sruthi Dec 07 '19 at 08:14

How to find the biggest symmetric word using Python in quick way?

2 Answers2