Print All Permutations of a String

Given an input string STR, generate and print all possible permutations of the string.

Input:

str

Output:

All permutations of the input string, each on a new line.

Example:

Input:

"abc"

Output:

abc
acb
bac
bca
cab
cba

Constraints:

The input string STR consists only of lowercase alphabets.

1 ≤ length of STR ≤ 8

Time Limit: 1 second

Note:

The input string may contain duplicate characters, resulting in duplicate permutations. The order of the permutations does not matter.

Question

Given an input string STR, generate and print all possible permutations of the string.

str

All permutations of the input string, each on a new line.

"abc"

abc
acb
bac
bca
cab
cba

The input string may contain duplicate characters, resulting in duplicate permutations. The order of the permutations does not matter.

Accepted Answer

Generate and print all possible permutations of a given input string.

Use recursion to generate all permutations by swapping characters in the string.
Maintain a visited array to keep track of characters already used in a particular permutation.
Print each permutation as it is generated.
Handle duplicate characters by skipping swapping if the character is already in the current position.

Indiamart Intermesh Associate Software Engineer interview questions & answers