## A Space Optimized DP solution for 0-1 Knapsack Problem

Problem Statement We are given a knapsack which can hold some weight, we need to pick some of the items out of given items with some value. The items should be picked such that the value of the knapsack ( total value of picked up items ) should be maximized. …

Read moreA Space Optimized DP solution for 0-1 Knapsack Problem