String Permutation, is a Backtracking related problem and in this post we will see how we can solve this challenge in C++

Given a string ,print all its permutations Works only for string without any duplicates TC: O(n* n!) since there can be n! possible pmt and for each pmt it takes O(n) for printing it since all the pmt are leaf nodes

Please check the main.cpp snippet for the solution.

This solution originally posted at: Github by @susantabiswas