Dsa
Recursion
Hard
Permutations with Duplicates
Given a collection of integers that might contain duplicates, return all possible unique permutations. The input consists of a single line of space-separated integers. For input '1 1 2', the output should be '[[1, 1, 2], [1, 2, 1], [2, 1, 1]]'.
Key concepts
recursionbacktrackingpermutations
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