diff --git a/17-letter-combinations-of-a-phone-number/README.md b/17-letter-combinations-of-a-phone-number/README.md
new file mode 100644
index 0000000..194e7a6
--- /dev/null
+++ b/17-letter-combinations-of-a-phone-number/README.md
@@ -0,0 +1,31 @@
+<h2><a href="https://leetcode.com/problems/letter-combinations-of-a-phone-number/">17. Letter Combinations of a Phone Number</a></h2><h3>Medium</h3><hr><div><p>Given a string containing digits from <code>2-9</code> inclusive, return all possible letter combinations that the number could represent. Return the answer in <strong>any order</strong>.</p>
+
+<p>A mapping of digits to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters.</p>
+<img alt="" src="https://assets.leetcode.com/uploads/2022/03/15/1200px-telephone-keypad2svg.png" style="width: 300px; height: 243px;">
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre><strong>Input:</strong> digits = "23"
+<strong>Output:</strong> ["ad","ae","af","bd","be","bf","cd","ce","cf"]
+</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre><strong>Input:</strong> digits = ""
+<strong>Output:</strong> []
+</pre>
+
+<p><strong>Example 3:</strong></p>
+
+<pre><strong>Input:</strong> digits = "2"
+<strong>Output:</strong> ["a","b","c"]
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>0 &lt;= digits.length &lt;= 4</code></li>
+	<li><code>digits[i]</code> is a digit in the range <code>['2', '9']</code>.</li>
+</ul>
+</div>
\ No newline at end of file