ENH: Implemented a find_min_subset_sum function that solves the change-making problemFeature
The input is an array of integers, a target integer sum
and the following optional boolean flags:

closest: if a close approximation is accepted instead
of the target sum

verbose: prints debug information

greedy: uses a greedy approach to the problem,
minimizing complexity while accepting sub-optimal results

The output is a dictionary containing the subset array
and an integer with the achieved sum

Added tests for the function

Thanks for the pull request, but it appears there is no associated issue with this feature request. A new feature like this would need an issue and approval by the core team to proceed with a PR.

Closing as it's to early to have a PR for this feature. Also, happy to have you contribute to other issues labeled `good first issue`