Jan 2
3 min read
C++ Solution to Coding Challenge 17. Letter Combinations of a Phone Number
An example of a recursive algorithm
Problem statement
Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order.
