Decrypt String from Alphabet to Integer Mapping (Leetcode 1309)
Amazon, Microsoft, Google, Facebook, Netflix, Apple
Given a string s formed by digits ('0' - '9') and '#' . We want to map s to English lowercase characters as follows:
Characters ('a' to 'i') are represented by ('1' to '9') respectively.
Characters ('j' to 'z') are represented by ('10#' to '26#') respectively.
Return the string formed after mapping.
It's guaranteed 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"
Example 3:
Input: s = "25#"
Output: "y"
Example 4:
Input: s = "12345678910#11#12#13#14#15#16#17#18#19#20#21#22#23#24#25#26#"
Output: "abcdefghijklmnopqrstuvwxyz"
On this page of the site you can watch the video online Decrypt String from Alphabet to Integer Mapping (Leetcode 1309) with a duration of hours minute second in good quality, which was uploaded by the user Coding Interviews 03 February 2020, share the link with friends and acquaintances, this video has already been watched 2,973 times on youtube and it was liked by 23 viewers. Enjoy your viewing!
