Channel: Tushar Roy - Coding Made Simple
Category: Education
Tags: knapsack problemyt:cc=ondynamic programming01 knapsack0/1 knapsack problem
Description: Given a bag which can only take certain weight W. Given list of items with their weights and price. How do you fill this bag to maximize value of items in the bag. facebook.com/tusharroy25 github.com/mission-peace/interview/blob/master/src/com/interview/dynamic/Knapsack01.java github.com/mission-peace/interview/wiki