Given a string containing digits from 2 to 9 inclusive, with the possibility of each digit appearing multiple times, return all possible letter combinations that the number could represent. Return the answer in any order.

The illustration below shows the mapping of digits to letters in a telephone dial pad.

Note: The number $1$ on the telephone dial pad does not correspond to any letter, so the input string only contains digits from $2$ to $9$.

Constraints:

• $0 \leq$ digits.length $\leq 4$

• digits[i] is a digit in the range $[2, 9]$

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: