Subsets II Leetcode Solution

In this post, you will know how to solve the Subsets II Leetcode Solution problem of Leetcode. This Leetcode problem is done in many programming languages like C++, Java, and Python.

Subsets II Leetcode Solution
Subsets II Leetcode Solutions

One more thing to add, don’t directly look for the solutions, first try to solve the problems of Leetcode by yourself. If you find any difficulty after trying several times, then you can look for solutions.


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.

Example 1:

Input: nums = [1,2,2]
Output: [[],[1],[1,2],[1,2,2],[2],[2,2]]

Example 2:

Input: nums = [0]
Output: [[],[0]]


  • 1 <= nums.length <= 10
  • -10 <= nums[i] <= 10

Subsets II Leetcode Solutions in Python

class Solution:
  def subsetsWithDup(self, nums: List[int]) -> List[List[int]]:
    ans = []
    def dfs(s: int, path: List[int]) -> None:
      if s == len(nums):
      for i in range(s, len(nums)):
        if i > s and nums[i] == nums[i - 1]:
        dfs(i + 1, path + [nums[i]])
    dfs(0, [])
    return ans

Subsets II Leetcode Solutionin CPP

class Solution {
  vector<vector<int>> subsetsWithDup(vector<int>& nums) {
    vector<vector<int>> ans;
    sort(begin(nums), end(nums));
    dfs(nums, 0, {}, ans);
    return ans;
  void dfs(const vector<int>& nums, int s, vector<int>&& path,
           vector<vector<int>>& ans) {
    for (int i = s; i < nums.size(); ++i) {
      if (i > s && nums[i] == nums[i - 1])
      dfs(nums, i + 1, move(path), ans);

Subsets II Leetcode Solutions in Java

class Solution {
  public List<List<Integer>> subsetsWithDup(int[] nums) {
    List<List<Integer>> ans = new ArrayList<>();
    dfs(nums, 0, new ArrayList<>(), ans);
    return ans;
  private void dfs(int[] nums, int s, List<Integer> path, List<List<Integer>> ans) {
    ans.add(new ArrayList<>(path));
    for (int i = s; i < nums.length; ++i) {
      if (i > s && nums[i] == nums[i - 1])
      dfs(nums, i + 1, path, ans);
      path.remove(path.size() - 1);

Note: This problem Subsets II is generated by Leetcode but the solution is provided by BrokenProgrammers. This tutorial is only for Educational and Learning purposes.

Next: Gray Code Leetcode Solution

Leave a Reply

Your email address will not be published. Required fields are marked *