1) Find all permutations of a string. 2) Improve it so that the permutations are not repeated, Eg=> string is "aaaa" Answer should be just aaaa once not 4! times.
i want suggestion to improve the recursive code in case of 2) case . -- 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.
