longest substring palindrome problem

Question

1.00/5 (1 vote)

See more:

Hi
can you please tell me how to find longest substring palindrome?

Thanks

Please write steps with example

Posted 18-Apr-13 0:03am

Updated 18-Apr-13 1:14am

nv3

v2

Comments

Richard MacCutchan 18-Apr-13 7:58am

Don't you think you should at least try to do your own homework?

1 solution

Add a Solution

Treat my content as plain text, not as HTML

…

Sign in to your account

Download, Vote, Comment, Publish.

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)

CPallini · Answer 1 · 2013-04-18T00:06:00

I don't know why, but this question does not look new, to me: "Longest palindrome in a string"[^].

Posted 18-Apr-13 0:06am