Dsa
Recursion
Hard
Recursive String Permutations
Given a string, generate all possible permutations of the characters in the string. You should not include duplicate permutations when the string contains repeating characters. Print each permutation on a new line.
Example Input:
abc
Example Output:
abc
acb
bac
bca
cab
cba
Key concepts
recursionbacktrackingstring manipulation
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now