keep a hash to check if digit is already used for that combination or not. add this logic to existing combinations generator code.
On Sat, Aug 25, 2012 at 12:34 AM, amrit harry <[email protected]>wrote: > find the all possible combination of digits ranging 1 to 9 whose sum is > 10, > no digit shud be repeated in any combination. > 1234 > 127 > 136 > 145 > 19 > 235 > 28 > 37 > 46 > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/K9atBSG79wQJ. > 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. > -- .................................... *Regards *Ravi Maggon Member Technical - IT/Front Office D.E. Shaw & Co. -- 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.
