Modify knapsack algorithm in Python

Hi, I currently have an application that uses the knapsack algorithm to maximize the value (aggregate ratings) of N products subject to a total cost constraint. e.g., find me the 4 products that maximize total ratings subject to a budget of $100.

This works fine, except I also need to be able to apply a minimum budget in addition to the maximum budget. In other words, Id like to say find me the 4 products that maximize total ratings subject to a budget of a minimum of $80 and maximum of $100.

I will share the knapsack function with shortlisted candidates. I just have never dug into it to see how to enforce a range.

I probably have some other related algorithm improvement stuff to do, but need to fix this first.
About the recuiter
Member since Mar 14, 2020
Gautam Shetty
from Niutao, Tuvalu

---

---

Looking for help? Checkout our video tutorial
How to search and apply for jobs

How to apply? Do you have more questions about the Job?
See frequently asked questions