D. J.:

- Added the leetcode problem and solution for 90

Author: nobodyPerfecZ

README.md

@@ -134,6 +134,7 @@
 - [86 Partition List](https://leetcode.com/problems/partition-list/description/)
 - [88 Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/description/)
 - [89 Gray Code](https://leetcode.com/problems/gray-code/description/)
+- [90 Subsets II](https://leetcode.com/problems/subsets-ii/description/)
 - [91 Decode Ways](https://leetcode.com/problems/decode-ways/description/)
 - [92 Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/description/)
 - [95 Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/description/)

awesome_python_leetcode/_90_subsets_II.py

@@ -0,0 +1,26 @@
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def subsetsWithDup(self, nums: List[int]) -> List[List[int]]:
+        """
+        Given an integer array nums that may contain duplicates, return all possible
+        subsets (the power set).
+
+        A subset of an array is a selection of elements (possibly none) of the array.
+
+        The solution set must not contain duplicate subsets. Return the solution in any
+        order.
+        """
+        nums = sorted(nums)
+        results = [[]]
+        visited = set()
+        for value in nums:
+            for i in range(0, len(results)):
+                new_subset = results[i] + [value]
+                if tuple(new_subset) not in visited:
+                    visited.add(tuple(new_subset))
+                    results.append(new_subset)
+        return results

tests/test_90_subsets_II.py

@@ -0,0 +1,18 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._90_subsets_II import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["nums", "expected"],
+    argvalues=[
+        ([1, 2, 2], [[], [1], [2], [1, 2], [2, 2], [1, 2, 2]]),
+        ([0], [[], [0]]),
+    ],
+)
+def test_func(nums: List[int], expected: List[int]):
+    """Tests the solution of a LeetCode problem."""
+    subsets = Solution().subsetsWithDup(nums)
+    assert subsets == expected