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

[AasheeshLikePanner]

Describe your change:

Changes the code to return the tuples. So, we can add doctests in it after it. Change the whole code now code using dynamic programming as it header says

• Add an algorithm?
• Fix a bug or typo in an existing algorithm?
• Documentation change?

Checklist:

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized.
• I know that pull requests will not be merged if they fail the automated tests.
• This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• All new Python files are placed inside an existing directory.
• All filenames are in all lowercase characters with no spaces or dashes.
• All functions and variable names follow Python naming conventions.
• All function parameters and return values are annotated with Python type hints.
• All functions have doctests that pass the automated testing.
• All new algorithms include at least one URL that points to Wikipedia or another similar explanation.
• If this pull request resolves one or more open issues then the description above includes the issue number(s) with a closing keyword: "Fixes #ISSUE-NUMBER".
  Change Code to return tuple in dynamic_programming/subset_generation.py #10189

[cclauss]

subset_combinations_dp() should work the same way as itertools.combinations(). It should present the same sort order and raise the same exceptions.

Suggested change

	print(f"{subset_combinations_dp(elements=[10, 20, 30, 40], n=2) =}")
	fromitertoolsimportcombinations
	foritems, nin (
	([10, 20, 30, 40], 2), ([1, 2, 3], 1), ([1, 2, 3], 3), ([42], 1),
	([6, 7, 8, 9], 4), ([10, 20, 30, 40, 50], 1), ([1, 2, 3, 4], 2),
	([1, 'apple', 3.14], 2), (['single'], 0), ([], 9)
	):
	actual=subset_combinations_dp(items, n)
	expected=list(combinations(items, n))
	assertactual==expected, f"items, n: {actual} != {expected}"
	print(f"{subset_combinations_dp(elements=[10, 20, 30, 40], n=2) =}")

[AasheeshLikePanner]

I have changed the code now code giving the list sorted order

[cclauss]

itertools.combinations([1, 'apple', 3.14], 2)

[cclauss]

Thanks for going the extra mile on this one... It is a nice upgrade!

[AasheeshLikePanner]

Really challenging and enjoyable. I fix one bug, then two errors comes. It's kind of frustrating, but worth the time.

[cclauss]

I fix one bug, then two errors comes. It's kind of frustrating, but worth the time.

Sounds like software engineering to me. ;-)