package
Version:
v1.6.3
Opens a new window with list of versions in this module.
Published: May 30, 2020
License: MIT
Opens a new window with license information.
Imports: 0
Opens a new window with list of imports.
Imported by: 0
Opens a new window with list of known importers.
README
¶
< Previous
Next >
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]
]
[Backtracking]
Similar Questions
- Next Permutation (Medium)
- Permutations (Medium)
- Palindrome Permutation II (Medium)
- Number of Squareful Arrays (Hard)
Documentation
¶
There is no documentation for this package.
Source Files
¶
Click to show internal directories.
Click to hide internal directories.