Problem Submissions Solution
Letter Combinations of Phone Number
Difficulty: Medium
Acceptance: 60.00%
Points: 30.00
The Letter Combinations of Phone Number problem requires generating all possible letter combinations that a given digit string could represent based on the mapping of digits to letters on a telephone keypad. Each digit from 2 to 9 maps to a set of letters. The task is to return all possible letter combinations that can be formed by choosing one letter for each digit in the same order. Digit to letter mapping follows the standard phone keypad: 2 ? "abc" 3 ? "def" 4 ? "ghi" 5 ? "jkl" 6 ? "mno" 7 ? "pqrs" 8 ? "tuv" 9 ? "wxyz"
Examples:
N/A
Constraints:
- 0 = digits.length = 4
- digits[i] is a digit from '2' to '9'
Companies:
Amazon Microsoft
Topics:
Recursion
