Bloomberg OA Question 2024 May | Backtracking | on-campus

Question: Subsets II Problem Statement Given an integer array nums that may contain duplicates, return all possible subsets (the power set). The solution set must not contain duplicate subsets. Return the solution in any order. Constraints 1 <= nums.length <= 10 -10 <= nums[i] <= 10 Examples Example 1: Input: nums = [1,2,2] Output: [[],[1],[1,2],[1,2,2],[2],[2,2]] Explanation 1: The array contains duplicates. Sorting it yields [1, 2, 2]. We use backtracking to expand paths, ensuring that we skip duplicates at the ...