Click here to Skip to main content
Rate this: bad
good
Please Sign up or sign in to vote.
See more: C Homework re-posted
Hi
 
can you please tell me how to find longest substring palindrome?
 
Thanks
 
Please write steps with example
Posted 18-Apr-13 1:03am
Edited 18-Apr-13 2:14am
nv330.2K
v2
Comments
Richard MacCutchan at 18-Apr-13 7:58am
   
Don't you think you should at least try to do your own homework?

1 solution

Rate this: bad
good
Please Sign up or sign in to vote.

Solution 1

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

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

  Print Answers RSS
0 OriginalGriff 386
1 Marcin Kozub 225
2 Sergey Alexandrovich Kryukov 215
3 /\jmot 189
4 Praneet Nadkar 173
0 OriginalGriff 8,289
1 Sergey Alexandrovich Kryukov 7,407
2 DamithSL 5,624
3 Maciej Los 4,989
4 Manas Bhardwaj 4,986


Advertise | Privacy | Mobile
Web04 | 2.8.1411023.1 | Last Updated 18 Apr 2013
Copyright © CodeProject, 1999-2014
All Rights Reserved. Terms of Service
Layout: fixed | fluid

CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100