LeetCode in TypeScript

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

Solution

function letterCombinations(digits: string): string[] {
    if (digits.length === 0) {
        return []
    }
    const letters: string[] = ['', '', 'abc', 'def', 'ghi', 'jkl', 'mno', 'pqrs', 'tuv', 'wxyz']
    const ans: string[] = []
    const sb: string[] = []
    findCombinations(0, digits, letters, sb, ans)
    return ans
}

function findCombinations(start: number, nums: string, letters: string[], curr: string[], ans: string[]): void {
    if (curr.length === nums.length) {
        ans.push(curr.join(''))
        return
    }
    for (let i = start; i < nums.length; i++) {
        const n = parseInt(nums.charAt(i))
        for (let j = 0; j < letters[n].length; j++) {
            const ch = letters[n].charAt(j)
            curr.push(ch)
            findCombinations(i + 1, nums, letters, curr, ans)
            curr.pop()
        }
    }
}

export { letterCombinations }

This site is open source. Improve this page.