permutations_ii

README

< Previous 　　　　　　　　　　　　　　　　 Next >

47. Permutations II (Medium)

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

Example:

Input: [1,1,2]
Output:
[
  [1,1,2],
  [1,2,1],
  [2,1,1]
]

Related Topics

[Backtracking]

Similar Questions

1. Next Permutation (Medium)
2. Permutations (Medium)
3. Palindrome Permutation II (Medium)