Identification of Knapsack problems and its Types

Details

Description

This video explains how to identify a given problem as a knapsack problem.The identification of a problem can be very important as it will boost your confidence to solve the problem easily and efficiently.I have shown the pattern of all knapsack problems.In each of these problem variation, you will be given an array and a capacity or a maximum limit.Every element in an array will have two choices, either to include or exclude an item.This pattern is a typical knapsack problem.I have also shown how to differentiate between knapsack problem types as 01 knapsack, Bounded Knapsack and Unbounded Knapsack.I have taken two very important problems which is the Subset Sum problem and the Coin Change problem to explain how to identify a knapsack problem.If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

========================================================================
Join this channel to get access to perks:
https://www.youtube.com/channel/UCnxhETjJtTPs37hOZ7vQ88g/join

INSTAGRAM : https://www.instagram.com/surya.pratap.k/

SUPPORT OUR WORK: https://www.patreon.com/techdose

LinkedIn: https://www.linkedin.com/in/surya-pratap-kahar-47bb01168

WEBSITE: https://techdose.co.in/

TELEGRAM Channel LINK: https://t.me/codewithTECHDOSE

TELEGRAM Group LINK: https://t.me/joinchat/SRVOIxWR4sRIVv5eEGI4aQ
=======================================================================
USEFUL LINKS:
01 Knapsack Recursion: https://youtu.be/mGfK-j9gAQA
Concept of Memoization: https://youtu.be/dT6dvdbpChA
Tabulation DP: https://youtu.be/WNkqbqyvR_0


#dynamicprogramming #dp #knapsack