Open aditya109 opened 3 years ago
Hi @aditya109 Please assign this issue to me
@aditya109 Hi, I'd love to work on this. Can you assign it to me ?
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 !
ok sure @aditya109
Hi, i would like to work on it too.! :)
As it has been 7 days and no response from the previous assignee, hence clearing the assignee @sbaijal ! 💔
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 !
Hi @aditya109 , you have linked another solution with this question. please check this out.
Reopening the issue for other contributors...
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:
Example 2:
Example 3:
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/