Letter Combinations of Phone Number Problem

Letter Combinations of Phone Number Problem — ExecCode Medium DSA Practice

Solve the Letter Combinations of Phone Number problem on ExecCode. Free online medium DSA practice in Backtracking. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description 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. Examples 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'].

Examples

Input digits = "23"; Output ["ad","ae","af","bd","be","bf","cd","ce","cf"]. Input digits = "2"; Output ["a","b","c"]

Constraints

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

Practice Letter Combinations of Phone Number free on ExecCode. Browse DSA problems, topic map, and placement guides.