Rod Cutting Problem | Dynamic Programming | Unbounded Knapsack

This video explains a very important programming interview problem which is the rod cutting problem.This is a famous dynamic programming problem which is very frequently asked in interviews and coding rounds.This problem is the same as unbounded knapsack problem.I have explained the problem statement using examples and shown the solution idea and the recursion solution with time complexity.I have then shown optimization needed to solve using dynamic programming. I have shown the code and algorithm for dynamic programming solution.This has polynomial time complexity. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by JOINING and SUBSCRIBING. LIKE and SHARE our video if you found it helpful...CYA :)

========================================================================
Join this channel to get access to perks:
   / @techdose4u  

INSTAGRAM :   / surya.pratap.k  

SUPPORT OUR WORK:   / techdose  

LinkedIn:   / surya-pratap-kahar-47bb01168  

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

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

TELEGRAM Group LINK: https://t.me/joinchat/SRVOIxWR4sRIVv5...
=======================================================================

USEFUL LINKS:-
01 Knapsack Recursion:    • 01 Knapsack using Recursion | Buildin...  
01 Knapsack Memoization:    • 01 Knapsack using Memoization | Conce...  
01 Knapsack Tabulation DP:    • 01 Knapsack Tabulation Dynamic Progra...  
Coin Change Problem:    • Coin Change Problem | Dynamic Program...  
Coin Change Problem 2:    • Coin Change 2 | Dynamic programming |...  



#dp #unboundedknapsack #rodcutting