Leetcode 17. Letter Combinations of a Phone Number

Given a string of digits 2–9, return all possible letter strings by mapping each digit to its phone-keypad letters — effectively computing the Cartesian product of per-digit letter sets; this is typically solved by DFS/backtracking to enumerate combinations (digits length ≤ 4).