This is a general way to get all subsets of a given array. The difference of this solution to *78 Subsets* is that the given array might contain duplicated elements. I first thought of using `set` to ...

Given a collection of integers that might contain duplicates, nums, return all possible subsets. Note: The solution set must not contain duplicate subsets.

Backtracking has proven itself to be a universal algorithmic technique that can be applied while solving all kinds of computational problems, from the most primitive (such as counting all possible ...