This is the 36th Video on our Dynamic Programming (DP) Playlist.
In this video we will try to solve a very good and another classic DP Problem "Minimum Cost to Cut a Stick" (Leetcode - 1547)
Trust me, this will no longer be a Medium Problem. I will explain the intuition so easily that you will never forget and start seeing this as cakewalk EASYYY.
We will do live coding after explanation and see if we are able to pass all the test cases.
Problem Name : Minimum Cost to Cut a Stick
Company Tags : GOOGLE
My solutions on Github : [ Ссылка ]
Leetcode Link : [ Ссылка ]
My Graph Concepts Playlist : [ Ссылка ]
My DP Concepts Playlist : [ Ссылка ]
My GitHub Repo for interview preparation : [ Ссылка ]
Subscribe to my channel : [ Ссылка ]
Instagram : [ Ссылка ]
Facebook : [ Ссылка ]
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips
#interviewpreparation #interview_ds_algo #hinglish
