Given a string of digits from 2-9, return all possible letter combinations that the number could represent (like a phone keypad). Digit 2 maps to abc, 3 maps to def, etc.
Example: Input "23". Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].
Read the full problem: LeetCode 17 - Letter Combinations