Watch 10 video solutions for Decrypt String from Alphabet to Integer Mapping, a easy level problem involving String. This walkthrough by Coding Interviews has 2,953 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
You are given a string s formed by digits and '#'. We want to map s to English lowercase characters as follows:
'a' to 'i') are represented by ('1' to '9') respectively.'j' to 'z') are represented by ('10#' to '26#') respectively.Return the string formed after mapping.
The test cases are generated so that a unique mapping will always exist.
Example 1:
Input: s = "10#11#12" Output: "jkab" Explanation: "j" -> "10#" , "k" -> "11#" , "a" -> "1" , "b" -> "2".
Example 2:
Input: s = "1326#" Output: "acz"
Constraints:
1 <= s.length <= 1000s consists of digits and the '#' letter.s will be a valid string such that mapping is always possible.