aditya109/git-osp-for-beginners
Vedi su GitHubLetter Combinations of a Phone Number [C-Solution required]
Open
#410 aperta il 2 ott 2021
C/C++Hacktoberfestgood first issue
Metriche repository
- Star
- (108 star)
- Metriche merge PR
- (Nessuna PR mergiata in 30 g)
Descrizione
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 <= 4digits[i]is a digit in the range['2', '9'].
Reference: https://leetcode.com/problems/letter-combinations-of-a-phone-number/