Did you take a look at dynamic_programming? Are there any existing implementation for this?

@poyea yes I did, also did this during a job interview, but I did not want to "overdo" the solution in the first place ;-)

I mean, this should go into dynamic_programming. Do you agree?

@poyea Sorry but no. This is a simple and recursive solution, the dynamic one looks different.

Yeah. It seems that a new folder might be the right place.

Would you mind adding a README.md in the folder? Just add something like this: https://en.wikipedia.org/wiki/Knapsack_problem

Example: https://github.com/TheAlgorithms/Python/tree/master/linear_algebra

@poyea added a Readme, also tests :-)

Travis tests have failed

Hey @tbsschroeder,
Please read the following log in order to understand the failure reason.
It'll be awesome if you fix what's wrong and commit the changes.

TravisBuddy Request Identifier: 12034a30-0f83-11eb-8acb-27a1e4e1eb88

Travis tests have failed

Hey @tbsschroeder,
Please read the following log in order to understand the failure reason.
It'll be awesome if you fix what's wrong and commit the changes.

TravisBuddy Request Identifier: f0eaee00-0f84-11eb-8acb-27a1e4e1eb88

@poyea everything should be complete right now.