Category: String

Combinations of words formed by replacing given numbers with corresponding English alphabets

Given a set of positive numbers, find all possible combinations of words formed by replacing the continuous digits with corresponding character of English alphabet. i.e. subset {1} can be replaced by A, {2} can be replaced by B, {1, 0} can be replaced J, {2, 1} can be replaced U, etc..

Read More Combinations of words formed by replacing given numbers with corresponding English alphabets