cpp-flashcards/org/study_deck_02/dsa/backtracking/0017-letter-combinations-of-a-phone-number.org

• 0017. Letter Combinations of a Phone Number
  • Approach
  • Python
  • C++

TODO 0017. Letter Combinations of a Phone Number   medium

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 digits 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 = "2"
Output: ["a","b","c"]

Constraints:

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

TODO Approach

Write your approach here.

TODO Python

class Solution:
    def letterCombinations(self, digits: str) -> List[str]:

TODO C++

class Solution {
public:
    vector<string> letterCombinations(string digits) {
        
    }
};