Practice Microsoft Coding Question | Real Coding Interviews | Hack2hire

NewThe Learning module is now liveSee what's new

Question Bank Learning

Pricing Blog Forum

Quick Summary

Generate all valid letter combinations from a digit string using a custom phone keypad mapping.
Consecutive identical digits can be grouped, where the group size selects the corresponding letter from the mapping.
Systematically explore all valid groupings and letter selections using recursion.

What This Tests

Recursive backtracking and decision tree exploration
String partitioning and dynamic index tracking
Constraint validation during state transitions
Combinatorial generation techniques

Common Patterns

Backtracking

Accepted

1.7k/3.3k

Acceptance Rate50.8%

Test Cases

Input

digits =

Output

Expected