Skip to content
This repository has been archived by the owner on Oct 14, 2021. It is now read-only.

Letter Combinations of a Phone Number [Golang-Solution required] #413

Open
aditya109 opened this issue Oct 2, 2021 · 2 comments
Open

Letter Combinations of a Phone Number [Golang-Solution required] #413

aditya109 opened this issue Oct 2, 2021 · 2 comments
Assignees

Comments

@aditya109
Copy link
Owner

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.

img

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/

@cBridges851
Copy link

Hello, can I have a go at this please 😊?

@aditya109
Copy link
Owner Author

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

Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Projects
None yet
Development

No branches or pull requests

2 participants