String Permutation Problem
The algorithm problem goes something like this:
If you are given a character and its possible substitution set, then write a function that would print all the permutation of its characters.
Eg.
Given word “java”
Substitution Set =>
j [“J”, “7”]
a [“@”, “J”, “9”]
v [“V”, “^”]
Based on this, the possible permutations could be: J@V@, 7JV9..
Here is my approach using java
Continue reading String Ordered Permutation Algorithm Problem