Backtracking algo

[yesiamrajeev]

A simple example to understand backtracking.
There is a String of length 3 we need to find every possible combinations for the String's characters replaced among each other.
The possibility lies in the Factorial. If the String's length is 3 then there are 6 possibilities which is N!.
Like that if the String's length is 4 then it'll be 24 just N!.

I want you to assign this issue to me with hacktoberfest lebel on it.