def test_letter_combinations(self): digit1 = "23" answer1 = ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"] self.assertEqual(sorted(letter_combinations(digit1)), sorted(answer1)) digit2 = "34" answer2 = ['dg', 'dh', 'di', 'eg', 'eh', 'ei', 'fg', 'fh', 'fi'] self.assertEqual(sorted(letter_combinations(digit2)), sorted(answer2))
def test_letter_combinations(self): digit1 = "23" answer1 = ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"] self.assertEqual(sorted(letter_combinations(digit1)), sorted(answer1)) digit2 = "34" answer2 = ["dg", "dh", "di", "eg", "eh", "ei", "fg", "fh", "fi"] self.assertEqual(sorted(letter_combinations(digit2)), sorted(answer2))
from algorithms.backtrack import letter_combinations """ 2: "abc" 3: "def" 4: "ghi" 5: "jkl" 6: "mno" 7: "pqrs" 8: "tuv" 9: "wxyz" """ n = "23" print(letter_combinations(n))