Pergunta de entrevista da empresa Amazon
Write an algorithm to output every possible string that can generated by a given 10-digit telephone number. (You know, how when you look at your phone's keypad the number 2 corresponds to A, B, or C, the number 9 corresponds to W, X, Y, or Z, etc.)
Resposta da entrevista
Sigiloso
30 de mar. de 2011
Pretty simple to implement using recursion. I was allowed to assume the existence of some data structure describing which letters corresponded to which number.