Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g0001_0100.s0017_letter_combinations_of_a_phone_number.Solution

```
public class Solution
extends Object
```
17 - 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 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 <= 4
- digits[i] is a digit in the range ['2', '9'].

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  List<String> letterCombinations(String digits)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

letterCombinations

public List<String> letterCombinations(String digits)