Similar Topics

Web Technologies32.1K+ articles

DSA20.4K+ articles

Mathematical5.1K+ articles

Arrays4.2K+ articles

Greedy1.4K+ articles

Dynamic Programming1.1K+ articles

Hash831+ articles

Recursion591+ articles

Google398+ articles

Memoization60+ articles

knapsack

40 posts

Difference Between Greedy Knapsack and 0/1 Knapsack Algorithms

Last Updated: 23 July 2025

The 0/1 Knapsack algorithm is a dynamic programming approach where items are either completely included or not at all. It considers all combinations to find the maximum to...read more

article_image

Algorithms-Greedy Algorithms

GFact | Why doesn't Greedy Algorithm work for 0-1 Knapsack problem?

Last Updated: 03 October 2023

In this article, we will discuss why the 0-1 knapsack problem cannot be solved by the greedy method, or why the greedy algorithm is not optimal for the 0-1 Knapsack Proble...read more

Approximation algorithms for Knapsack

Last Updated: 23 July 2025

Knapsack problems are those problems in which some set of items will be given to us, each with a weight and value and we will be asked to find the most valuable combinatio...read more

article_image

Dynamic Programming

Algorithms-Dynamic Programming

Greedy Algorithms

Introduction to Knapsack Problem, its Types and How to solve them

Last Updated: 23 July 2025

The Knapsack problem is an example of the combinational optimization problem. This problem is also commonly known as the "Rucksack Problem". The name of the problem is def...read more

Maximize cost of segment having weight at most K from given weight and cost of N items

Last Updated: 23 July 2025

Given two arrays W[] and C[] containing weight and cost of N (1 to N) items respectively, and an integer K, find a segment from 1 to N, such that the total weight of the s...read more

Minimize number of Knapsacks with total weigh W required to store Array containing elements greater than W/3

Last Updated: 23 July 2025

Given an array, arr[] and weight W. The task is to minimize the number of Knapsacks required to store all elements of the array. A single knapsack can store a maximum tota...read more

Maximum sum of values of N items in 0-1 Knapsack by reducing weight of at most K items in half

Last Updated: 23 July 2025

Given weights and values of N items and the capacity W of the knapsack. Also given that the weight of at most K items can be changed to half of its original weight. The ta...read more

Construct the largest number whose sum of cost of digits is K

Last Updated: 03 October 2025

Given a positive integer K, and an array arr[] consisting of N( =9) integers such that arr[i] represents the cost of the digit (i+1), the task is to find the largest numbe...read more

Dynamic Programming

Theft at World Bank

Last Updated: 23 July 2025

Given a sac of capacity W, and two arrays A[] and B[] of length N, where A[i] represents the weight of an ith block of gold and B[i] represents the profit gained by taking...read more

Unbounded Knapsack (Repetition of items allowed) | Efficient Approach

Last Updated: 23 July 2025

Given an integer W, arrays val[] and wt[], where val[i] and wt[i] are the values and weights of the ith item, the task is to calculate the maximum value that can be obtain...read more

Dynamic Programming

Sum of length of two smallest subsets possible from a given array with sum at least K

Last Updated: 03 October 2025

Given an array arr[] consisting of N integers and an integer K, the task is to find the sum of the length of the two smallest unique subsets having sum of its elements at ...read more

Dynamic Programming

Technical Scripter

Technical Scripter 2020

Max Profit from Two Machines

Last Updated: 28 April 2026

Given two machines, Machine A and Machine B, and a set of n tasks. The profit earned for performing each task is given in two arrays a[] and b[] such that if Machine A per...read more

article_image

Dynamic Programming

Amazon-Question

interview-preparation

Minimum absolute difference of server loads

Last Updated: 15 July 2025

Content RemovedFor similar problem visit: Partition a set into two subsets such that the difference of subset sums is minimum...read more

Dynamic Programming

interview-preparation

Count of Ways to obtain given Sum from the given Array elements

Last Updated: 15 July 2025

Given an array arr[], consisting of N non-negative integers and an integer S, the task is to find the number of ways to obtain the sum S by adding or subtracting array ele...read more

C++ Program for the Fractional Knapsack Problem

Last Updated: 15 July 2025

Pre-requisite: Fractional Knapsack ProblemGiven two arrays weight[] and profit[] the weights and profit of N items, we need to put these items in a knapsack of capacity W ...read more

Greedy Algorithms

1 2 3