Permutations II

Total Accepted: 30904 Total Submissions: 120330 My Submissions

Given a collection of numbers that might contain duplicates, return all possible unique permutations.

For example,
[1,1,2] have the following unique permutations:
[1,1,2], [1,2,1], and [2,1,1].

Show Tags

Have you met this question in a real interview?

Yes

Runtime Error Message:	{[{ runtimeError }]}
Last executed input:	{[{ lastExecutedTestCase }]}