Day 48 Possible words from phone digit

Author: mandliya

README.md

@@ -4,9 +4,9 @@
 
 | Current Status|     Stats     |
 | :------------: | :----------: |
-| Total Problems | 66 |
-| Current Streak | 47 |
-| Longest Streak | 47 ( August 17, 2015 - October 2, 2015 ) |
+| Total Problems | 67 |
+| Current Streak | 48 |
+| Longest Streak | 48 ( August 17, 2015 - October 3, 2015 ) |
 
 </center>
 
@@ -107,6 +107,7 @@ Include contains single header implementation of data structures and some algori
 | Euclidean algorithm to find greatest common divisor of two numbers. (Iterative and recursive)|[gcd.cpp](math_problems/gcd.cpp)|
 | Implement pow(x,y) using divide and conquer approach. Try implementing it in O(logn)| [pow.cpp](math_problems/pow.cpp)|
 | Calculate factorial of large number, say 100 (it will have 158 digits) |[factorial_of_large_num.cpp](math_problems/factorial_of_large_num.cpp)|
+| Generate all possible words from a number entered on a traditional mobile keypad | [phone_digits.cpp](math_problems/phone_digits.cpp)|
 
 ### Stack Problems
 | Problem | Solution |