GREEDY ALGORITHM
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a set of items, each with a value and a weight, and a knapsack with a maximum weight capacity, implement a function that finds the maximum value that can be placed in the knapsack using a greedy algorithm.
+========+
Please answer to this message with your solution 🙂
>>Click here to continue<<