0-1 Backpack/knapsack Problem

Could be a visual representation of BTS problem solving. It also could be a great project for new programmers to check out, since there are numerous ways to solve this.

I'm gonna be honest this is also a bit of a personal problem aswell due to the fact we had to deal with it ourselves numerous time during uni. Mainly because as I already said there are a few ways to work this problem out.

ps.: sry for the poor english haven't really used it for a while
Have a good one people 🚋 (not really a train but I guess it will have to do)