this will need two passes first pass creates the hash map of char and count
second pass walk over the the string again, refer hash map to print that many chars, remove this char from hash once printed and move on untill the complete string is covered or hashmap size is 0 Best Regards Ashish Goel "Think positive and find fuel in failure" +919985813081 +919966006652 On Sun, Jun 26, 2011 at 5:35 PM, Vikash kumar <vikash.nitdgp9...@gmail.com>wrote: > use > #include<string.h> instead of #include<strings.h> > > -- > 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. > -- 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.
