Skip to main content
DSA is fun

Letter Combinations of a Phone Number

Given a string of digits (2-9), return every possible letter combination the digits could represent on a phone keypad.

Read the full walkthrough →
Visualization step 1 of 35. VISIT.
State
Vvisit
Step 1 / 35
Array Visualization
0
Step 1 / 35
Step 1 of 35. VISIT. Expand "23" one digit at a time, branching into every letter that digit's keypad maps to.
Step Explanation1 / 35
VISIT

Expand "23" one digit at a time, branching into every letter that digit's keypad maps to.

Output0 results
No output yet.
Step forward to generate results.