Search⌘ K
AI Features

Solution: Letter Combinations of a Phone Number

Discover how to apply the subsets pattern and backtracking to generate all valid letter combinations from a digit string on a phone keypad. Understand the recursive exploration of mapping digits to letters and gain skills in solving similar backtracking problems efficiently.

Statement

Given a string containing digits from 2 to 9 inclusive, with the possibility of each digit appearing multiple times, return all possible letter combinations that the number could represent. Return the answer in any order.

The illustration below shows the mapping of digits to letters in a telephone dial pad.

Note: The number 11 on the telephone dial pad does not correspond to any letter, so the input string only contains digits from 22 to 99.

Constraints:

  • 00 \leq digits.length 4\leq 4

  • digits[i] is a digit in the range [2,9][2, 9] ...