Solving Permutations II in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

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


Input: [1,1,2]

See the full details of the problem Permutations II at LeetCode

Originally posted at: