i am trying to get all different possibilites of my string but i get lost when get deep in it.
char *s = "dummy"
but there may be substitutions for specifici characters.
e.g. (u-f) (u-z) (y-w)
so all possible strings are:
i thinik algorithm is a recursion.