N-th Permutation of a string

Find Nth lexicographic permutation of stringProblem Statement

Given a string of length of m containing only lowercase alphabets. Find out the lexicographic nth permutation of the given string.

For example:

If given string, s = "abc", find 3rd permutationpermutations of "abc" are:1. abc2. acb3. bac4. bca5. cab6. cbaSo, the third permuation of will be "bac".Use Recursion and Backtracking to solve

In this approach we find all the distinct permutations of the given string using recursi...