Given a telephone number, find all the permutations of the letters assuming 1=abc, 2=def, etc.
given solution(probable) :Standard "find all permutations" of XYZ, except for each XYZ, you include permutations for each X0...Xn, Y0...Yn, etc Does this example satisfy everything being asked? eg. telephone number be 12 so total no. of permutations are (no. of permutations of abc) x (no. of permutations of def) any decent way to generate all the permutations? -- 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.
