Given a string of digits 2-9, return all possible letter combinations that the number could represent (like a phone keypad).
Input: digits = '23' Output: ['ad','ae','af','bd','be','bf','cd','ce','cf']
Unlock hints progressively — start gentle, go deeper only if needed.
Level 1: Gentle Nudge
A subtle direction
Level 2: Approach
The algorithm to use
Level 3: Detailed
Step-by-step guidance
to save progress and use AI features