Problem 1127. Decrypt a secret message!
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'.
Solution Stats
Problem Comments
-
1 Comment
Dyuman Joshi
on 12 Oct 2022
Test cases added.
Solution Comments
Show commentsProblem Recent Solvers20
Suggested Problems
-
1552 Solvers
-
263 Solvers
-
Convert hex color specification to MATLAB RGB
240 Solvers
-
Generate N equally spaced intervals between -L and L
856 Solvers
-
313 Solvers
More from this Author92
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!