Letter Combinations of a Phone Numer – Leetcode #17
This problem is from Leetcode. The problem statement in short is given below: Given a string of digits from 2 to 9, return all possible letter combinations that the number could represent, based on the classic phone keypad mapping. SOLUTION FIRST APPROACH See the code sample below : You can checkout the code from Github…