Letter Combinations of a Phone Number [Java-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/

[sbaijal]

Hi @aditya109
Please assign this issue to me

[varnaa]

@aditya109 Hi, I'd love to work on this. Can you assign it to me ?

[aditya109]

Hi @sbaijal ! 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 !

[sbaijal]

ok sure @aditya109

[akankshatyagiat]

Hi, i would like to work on it too.! :)

[aditya109]

As it has been 7 days and no response from the previous assignee, hence clearing the assignee @sbaijal ! 💔

[aditya109]

Hi @akankshatyagiat ! 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 !

[akankshatyagiat]

Hi @aditya109 , you have linked another solution with this question.
please check this out.

[aditya109]

Reopening the issue for other contributors...