0/1 Knapsack problem | Dynamic Programming

This lecture is on 0/1 Knapsack in Dynamic Programming in Analysis of Algorithms in Hindi. This ;lecture talks about what is 0/1 Knapsack and also solves a problem on it.

Purchase most updated notes right now,
more details below:

Playlist to Analysis of Algorithm:
Playlist to Blockchain Technology:
Playlist to Theoretical Computer Science:
Playlist to Software Engineering:

*Gears I use for this YouTube Channel:

*Let's connect:

[sarthakkalikar]

hey bud just wanted to tell u how amazing you teach and how much it is helping me and people like me thankyou so much brother.

[shreyashsinghnegi]

areee i swear i was looking for your video just rn after completing fractional Knapsack

[nashalmeida]

Sir, for the exam, do you prefer the sets method for the 0/1 knapsack problem or the table method?

[Imamanpandey]

Ye thoda bakchod hai bss....padhata to badhiya hai 😂

[ZaidSeliya-lw]

weight same raha aur value increase decrease hui to kya karege bhai plz batao

[fd.shubhamkadam]

Sir aap sppu computer engineering kr daa subject mai previous year problem solve kro na

[sarthakbangale]

please optimal binary tree samhado bhot hi complex lagraha he

[ivyy]

i think you meant "Elimination?" XD