0-1 Knapsack and Variations
Knapsack simply means bag. A bag of given capacity. We have to pack n items into this bag, and every item has some weight and value. We have to make sure the total weight of items is less than or equal to the weight that a bag can hold. At the same time, we have to maximize the value of items packed in the bag. This is the basics of the Knapsack problem. Now 0-1 Knapsack says you can either take the item as a whole or not, but you cannot break the item and take some part of it.
By Aditya Narayan Joardar
● Published At Nov 2021
This article is based on the Subset problem asked in various coding competitions.... Keep reading ..
0-1 Knapsack
By Harsh Goyal
● Published At Dec 2021
This article will discuss the 0-1 Knapsack problem and various ways to solve this problem.... Keep reading ..
Count Number of subsets with given Sum
By Sneha Mallik
● Published At Oct 2021
This blog covers the concept of counting the number of subsets with a given sum. We will learn about its implementation, algorithm, time complexity and space complexity. ... Keep reading ..
Subset Sum Problem
By Nishant Rana
● Published At Oct 2021
This blog will cover the question Subset Sum Problem and discuss its Time and Space complexity.... Keep reading ..
Coin Change: Minimum Number Of Coins
By Deeksha
● Published At Oct 2021
This blog will discuss the three approaches to the most asked questions: coin change the minimum number of coins along with the discussion on their time and space complexities.... Keep reading ..
Unbounded Knapsack
By Reet Maggo
● Published At Dec 2021
This article will explain the various knapsack problems and especially illustrate the Unbounded Knapsack while explaining its working with the help of a code snippet and algorithm. The blog will further discuss time and space complexity for Unbounded... Keep reading ..
Target Sum
By Deeksha Rajput
● Published At Dec 2021
In this blog, we will be discussing three approaches for a problem target sum along with their space and time complexities. Target sum is the frequently asked question in all tech interviews.... Keep reading ..