Solving Letter Combinations of a Phone Number in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

A mapping of digit to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters.

Example:

Input: "23"
Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].

Note:

Although the above answer is in lexicographical order, your answer could be in any order you want.

See the full details of the problem Letter Combinations of a Phone Number at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go