deven/leetcode
1
0
Fork 0
mirror of https://github.com/devenperez/leetcode.git synced 2026-06-13 14:57:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Create README - LeetHub

Browse Source
This commit is contained in:
Deven
2022-07-15 22:51:29 -04:00
parent c618e12175
commit 67b9446a89
1 changed files with 31 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
17-letter-combinations-of-a-phone-number/README.md
+31
View File
@@ -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>