0/1 Knapsack Problem Dynamic Programming

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. https://www.facebook.com/tusharroy25 https://github.com/mission-peace/interview/blob/master/src/com/interview/dynamic/Knapsack01.java https://github.com/mission-peace/interview/wiki