@Dinesh : We dont have to chk whether its a palindrome or not bt whether it CAN form a palindrome or not...
On Mon, Jul 25, 2011 at 8:56 PM, sasi kumar <[email protected]> wrote: > Hi > On 25 July 2011 19:51, dinesh bansal <[email protected]> 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 [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Aditi Garg Undergraduate Student Electronics & Communication Divison NETAJI SUBHAS INSTITUTE OF TECHNOLOGY Sector 3, Dwarka New Delhi 9718388816 -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
