Merge pull request #9 from iamAntimPal/Leetcode-75

Leetcode 75

Author: iamAntimPal

Solution/17. Letter Combinations of a Phone Number/17. Letter Combinations of a Phone Number.py

@@ -0,0 +1,10 @@
+class Solution:
+    def letterCombinations(self, digits: str) -> List[str]:
+        if not digits:
+            return []
+        d = ["abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"]
+        ans = [""]
+        for i in digits:
+            s = d[int(i) - 2]
+            ans = [a + b for a in ans for b in s]
+        return ans