Dsa
Strings
Medium
String Rearrangement
Given a string, return all unique permutations of its characters. The resulting permutations should be a list of strings.
Example Input:
'aabc'
Example Output:
['aabc', 'abac', 'abba', 'baac', 'baba', 'caab']
Key concepts
stringspermutationsbacktracking
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