how to display the longest palindrome in a string of characters?

Question

1.00/5 (1 vote)

See more:

one of my friend encountered this question in ACHERON's technical interview.the questioner had asked to display the longest palindrome in a given string.
for example:"nitinwearsottoeverytime"-no spaces.
where nitin and otto are the two possible palindrome and since nitin is 5characters and long,it must bedisplayed.
what is the code to perform this?
do explain the logic to clear this!

Posted 30-Sep-14 16:45pm

Member 1097736

Add a Solution

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

jadavparesh06 · Answer 1 · 2014-09-30T16:53:00

Solution 1

You can find the the longest palindrome using Manacher's Algorithm in O(n) time! Its implementation can be found here
For input String s = "HYTBCABADEFGHABCDEDCBAGHTFYW1234567887654321ZWETYGDE". It finds the correct output which is 1234567887654321.

Posted 30-Sep-14 16:53pm

jadavparesh06

Updated 30-Sep-14 20:45pm

v2

Comments

Member 1097736 1-Oct-14 9:17am

could you explain how it performs logic stepwise?

BillWoodruff · Answer 2 · 2014-09-30T20:49:00

Solution 2

For a good explanation of the logic in solving this problem in linear time: [^].

For many implementations in C#: [^].

Posted 30-Sep-14 20:49pm

BillWoodruff

Comments

Member 1097736 1-Oct-14 9:08am

could you explain how it performs logic stepwise?