GoLang Solution For LeetCode Problem: Permutations II
Solving Permutations II in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Given a collection of numbers that might contain duplicates, return all possible unique permutations.
Input: [1,1,2] Output: [ [1,1,2], [1,2,1], [2,1,1] ]
See the full details of the problem Permutations II at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go