Letter Combinations of a Phone Number [C-Solution required]

[aditya109]

Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order.

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 1:

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

Example 2:

Input: digits = ""
Output: []

Example 3:

Input: digits = "2"
Output: ["a","b","c"]

Constraints:

• 0 <= digits.length <= 4
• digits[i] is a digit in the range ['2', '9'].

Reference: https://leetcode.com/problems/letter-combinations-of-a-phone-number/

[varnaa]

@aditya109 Hi, i'd like to work on this issue.

[aditya109]

Hi @varnaa ! have assigned this issue to you. Before raising a PR, please take a look at CONTRIBUTING.md and follow the guidelines. Also, if it is not too much to ask, please consider starring ⭐ the repository. It helps boost the repo popularity and guide more people towards active contribution. That is all. Happy hacking !

[Kevinjadia]

I want to work on this issue

[aditya109]

Hi @Kevinjadia ! Sure thing. I have assigned this issue to you.
Before raising a PR, please take a look at CONTRIBUTING.md and follow the guidelines.
Also, if it is not too much to ask, please consider starring ⭐ the repository. It helps boost the repo popularity and guide more people towards active contribution. That is all. Happy hacking !

[Kevinjadia]

Thank you for assigning me this issue
Can I use C++ to solve this issue?

[aditya109]

Sorry but you can't. As mentioned in the issue topic, this has to be solved in C. For solving the same in C++, please lay your claim on #409 .