Minimum Cost For Tickets - (GOOGLE) | Leetcode-983 | 2 Approaches | Explanation ➕ Live Coding
This is the 17th Video on our Dynamic Programming (DP) Playlist.
In this video we will try to solve another very famous and good DP Problem "Minimum Cost For Tickets" (Leetcode - 983)
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 : Minimum Cost For Tickets
Company Tags : GOOGLE
My solutions on Github : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Minimum%20Cost%20For%20Tickets.cpp
Leetcode Link : https://leetcode.com/problems/minimum-cost-for-tickets/
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:46 - Khandani Approach (Recur + Memo)
23:28 - Story to Code (Recur + Memo)
28:23 - Bottom UP Story
42:37 - 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