From 1662e01e2c006e9570d867c1f9b9fb48bbc3705f Mon Sep 17 00:00:00 2001
From: Deven <63876261+devenperez@users.noreply.github.com>
Date: Mon, 24 Nov 2025 19:24:09 -0500
Subject: [PATCH] Create README - LeetHub
---
.../README.md | 26 +++++++++++++++++++
1 file changed, 26 insertions(+)
create mode 100644 0017-letter-combinations-of-a-phone-number/README.md
diff --git a/0017-letter-combinations-of-a-phone-number/README.md b/0017-letter-combinations-of-a-phone-number/README.md
new file mode 100644
index 0000000..816788c
--- /dev/null
+++ b/0017-letter-combinations-of-a-phone-number/README.md
@@ -0,0 +1,26 @@
+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 digits 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 = "2"
+Output: ["a","b","c"]
+
+
+
+Constraints:
+
+
+ 1 <= digits.length <= 4digits[i] is a digit in the range ['2', '9'].