public class Solution { public IList<IList<int>> PermuteUnique(int[] nums) { }
}

/** * @param {number[]} nums * @return {number[][]} */
var permuteUnique = function(nums) {
};

# @param {Integer[]} nums
# @return {Integer[][]}
def permute_unique(nums)
end

class Solution { func permuteUnique(_ nums: [Int]) -> [[Int]] { }
}

class Solution {
public: vector<vector<int>> permuteUnique(vector<int>& nums) { }
};

class Solution { /** * @param Integer[] $nums * @return Integer[][] */ function permuteUnique($nums) { }
}

class Solution { public List<List<Integer>> permuteUnique(int[] nums) { }
}

function permuteUnique(nums: number[]): number[][] {
};

/** * Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free(). */
int** permuteUnique(int* nums, int numsSize, int* returnSize, int** returnColumnSizes){
}