X

DAYS

:

HOUR

:

MINS

:

SEC

Copied to Clipboard
Permutations of a given string
Medium Accuracy: 49.85% Submissions: 44919 Points: 4

Given a string S. The task is to print all permutations of a given string in lexicographically sorted order.

Example 1:

Input: ABC
Output:
ABC ACB BAC BCA CAB CBA
Explanation:
Given string ABC has permutations in 6
forms as ABC, ACB, BAC, BCA, CAB and CBA .


Example 2:

Input: ABSG
Output:
ABGS ABSG AGBS AGSB ASBG ASGB BAGS
BASG BGAS BGSA BSAG BSGA GABS GASB
GBAS GBSA GSAB GSBA SABG SAGB SBAG
SBGA SGAB SGBA
Explanation:
Given string ABSG has 24 permutations.


You don't need to read input or print anything. Your task is to complete the function find_permutaion() which takes the string S as input parameter and returns a vector of string in lexicographical order.

Expected Time Complexity: O(n! * n)

Expected Space Complexity: O(n)

Constraints:
1 <= length of string <= 5

We are replacing the old Disqus forum with the new Discussions section given below.