Problem	Solution
You are given a digit string (e.g "1234", "567" etc), provide all possible letter combinations we could generate from this digit string, based on the mapping we see on the telphone/mobile dialpad. If you have typed SMS in old style phones, you would know. For e.g. "1" is mapped to "abc", 2 is mapped to "def". You can refer to the image.. Example: "34" will give output: {"dg","dh","di","eg","eh","ei","fg","fh","fi"} Note that order does not matter in result set.	dialpad_combinations.cpp
Implement wildcard pattern maching with support for '?' & ''. '?' Matches any single character. '' Matches any sequence of character. . Checkout examples in file for more details.	wild_card_matching.cpp
Given a 2D board and list of words from a dictionary, find all the possible words on board fromt the list. (Check example in the solution)	word_search.cpp

Provide feedback

Saved searches