@Abhi See every character in the string is read exactly once and hashed. So the complexity is O(n) only. Mistake you're doing is adding n/2 n times, but if you see in your example you have to add it twice only.
-- AP -- 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.
