Hi
On 25 July 2011 19:51, dinesh bansal <bansal...@gmail.com> wrote:
> Can you please elaborate on this?
Given a string say "teste" find the length .
Here length = 5 . Its odd . So one character must occur odd
number of time . Here it is s ->1(odd) . Rest must occur even
number of time t->2 , e->2 .
So it must form a palindrome
> I think what you said is the neccessary condition for palindroms but not the
> sufficient. What I mean is with these checks, you can rule out the
> non-palindrom strings quickly but to make sure that a particular string is
> palindrom, you will need to have some more checks.
These checks are enough . It will work in all cases
Regards
Sasi kumar T
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
