Dsa
Backtracking
Easy
Permutation of a String
Given a string, write a function to generate all unique permutations of the characters in the string. Return the permutations as a list of strings. The input will be a single line containing the string. Example:
Input:
abc
Output:
['abc', 'acb', 'bac', 'bca', 'cab', 'cba']
Key concepts
backtrackingpermutationsstrings
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