The crypto system in question is based on phone keyboard. We need two numbers in order to decrypt a word. First number represents relevant letters on a phone keyboard. We must sort all possible (meaningful or meaningless) string permutations. then select next number(th) word from this permutation list.
For example if input is [2 1];
there are three letters on phone keyboard '2' which is 'abc'. We sort this letters as {'a';'b';'c'} then select first one. Output is 'a'.
Another example if input is [2639 99]
output must be 'cody', since from all sorted possible string permutations with {'abc','mno','def','wxyz'} the 99th is 'cody'.
This one is related with Problem 1124
Solve

Solution Stats

60 Solutions

23 Solvers

Last Solution submitted on Jul 16, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers23

Chris Cleveland George Berken David Hill Lorenzo

Suggested Problems

More from this Author92

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!