Skip to content

Latest commit

 

History

History
23 lines (14 loc) · 294 Bytes

problem.md

File metadata and controls

23 lines (14 loc) · 294 Bytes
Raw

Problem 47: Permutations II

Difficulty: Medium

Problem

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

Example

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

[
  [1,1,2],
  [1,2,1],
  [2,1,1]
]