You are given a string s formed by digits and the character '#'. We want to map s to lowercase English characters as follows:

• Characters from 'a' to 'i' are represented by $'1'$ to $'9'$ respectively.

• Characters from 'j' to 'z' are represented by '10#' to '26#' respectively.

Return the string formed after mapping.

Constraints:

• $1 \leq$ s.length $\leq 1000$

• s consists of digits and the '#' character.

• s is a valid string such that a mapping is always possible.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.