class ImportantStuff(object):
def do_stuff_1(self):
def do_stuff_2(self):
def do_stuff_3(self):

Problem Statement #

Given two integer arrays to represent weights and profits of ’N’ items, we need to find a subset of these items which will give us maximum profit such that their cumulative weight is not more than a given number ‘C’. Each item can only be selected once, which means either we put an item in the knapsack or skip it.

# to calculate area of rectangle
def area(length, breadth):
calc = length * breadth
print calc

Sabyasachi Nayak

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store