Reducing Dishes - (MICROSOFT) | Leetcode-1402 | 2 Approaches | Explanation ➕ Live Coding

This is the 18th Video on our Dynamic Programming (DP) Playlist. In this video we will try to solve a very good DP Problem "Reducing Dishes" (Leetcode - 1402) We will solve it using Recursion + Memoization technique as well as Bottom UP DP. We will do live coding after explanation and see if we are able to pass all the test cases. Problem Name : Reducing Dishes Company Tags : MICROSOFT My solutions on Github : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Reducing%20Dishes.cpp Leetcode Link : https://leetcode.com/problems/reducing-dishes/ My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo Subscribe to my channel : https://www.youtube.com/@codestorywithMIK 0:00 - Understanding Problem 8:12 - Khandani Approach (Recur + Memo) 14:00 - Story to Code (Recur + Memo) 18:22 - Bottom UP Story 28:47 - Story to Code (Bottom UP) ╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗ ║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣ ╠╗║╚╝║║╠╗║╚╣║║║║║═╣ ╚═╩══╩═╩═╩═╩╝╚╩═╩═╝ #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips #interviewpreparation #interview_ds_algo #hinglish