Changes the code To return the list in dynamic_programming/subset_generation.py

dynamic_programming/subset_generation.py

@@ -1,7 +1,33 @@
 # return all subset combinations of n element in given set of r element.
 
 
-def subset_combinations_dp(elements, n):
+def subset_combinations_dp(elements: list, n: int) -> list:
+    """
+        Generate all possible combinations of n elements from the given list of elements using dynamic programming.
+        Args:
+            elements (list): The list of elements from which combinations will be generated.
+            n (int): The number of elements in each combination.
+        Returns:
+            list: A list of tuples, each representing a combination of n elements.
+            >>> subset_combinations_dp(elements=[10, 20, 30, 40], n=2)
+            [(10, 20), (10, 30), (20, 30), (10, 40), (20, 40), (30, 40)]
+            >>> subset_combinations_dp(elements=[1, 2, 3], n=1)
+            [(1,), (2,), (3,)]
+            >>> subset_combinations_dp(elements=[1, 2, 3], n=3)
+            [(1, 2, 3)]
+            >>> subset_combinations_dp(elements=[42], n=1)
+            [(42,)]
+            >>> subset_combinations_dp(elements=[1, 2, 3, 4, 5], n=3)
+            [(1, 2, 3), (1, 2, 4), (1, 3, 4), (2, 3, 4), (1, 2, 5), (1, 3, 5), (2, 3, 5), (1, 4, 5), (2, 4, 5), (3, 4, 5)]
+            >>> subset_combinations_dp(elements=[6, 7, 8, 9], n=4)
+            [(6, 7, 8, 9)]
+            >>> subset_combinations_dp(elements=[10, 20, 30, 40, 50], n=0)
+            [()]
+            >>> subset_combinations_dp(elements=[1, 'apple', 3.14], n=2)
+            [(1, 'apple'), (1, 3.14), ('apple', 3.14)]
+            >>> subset_combinations_dp(elements=['single'], n=0)
+            [()]
+        """
     r = len(elements)
 
     dp = [[] for _ in range(r + 1)]
@@ -20,3 +46,7 @@ def subset_combinations_dp(elements, n):
 
 if __name__ == "__main__":
     print(f"{subset_combinations_dp(elements=[10, 20, 30, 40], n=2) = }")
+
+    import doctest
+
+    doctest.testmod()