Dsa
Backtracking
Easy
Permutation of String
Given a string, return all possible unique permutations of the string. The input consists of a single string, which can have duplicate characters. Example: Input: 'aabc' Output: ['aabc', 'aacb', 'abba', 'abab', 'bbaa']
Key concepts
backtrackingpermutation
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