01 Knapsack using Memoization | Concept of Memoization

In this video, I have explained the basic concepts of memoization using 01 knapsack as an example.I have already explained the 01 knapsack using recursion method in my previous video and here I have continued the topic and showed how to apply smart recursion using an additional data structure.Remembering previously calculated subproblem values so as to not recalculate will improve time complexity and that's the goal of using memoization.We can remember the past by storing results in certain data structures which is generally array or map.I have first shown the example for why we need optimization on recursion and then I have shown how to optimize the recursion by using simple examples and code explanation. 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:    / @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 | Building Int...   01 Knapsack DP:    • 01 Knapsack Tabulation Dynamic Programming...   #01knapsack #dp #memoization