DP-3 Minimizing Coins | Problem Solving | Competitive Programming | DSA | CSES скачать в хорошем качестве

DP-3 Minimizing Coins | Problem Solving | Competitive Programming | DSA | CSES

In this video we start have discussed the 2nd problem from the CSES Problemset from the Dynamic Programming section. Exploring the importance of states, transitions and the relations between subproblems, this video will help you strengthen you DP concepts further. Problem Name: Minimizing Coins Problem Link:https://cses.fi/problemset/task/1634 Notes and Solution Codes from the video: https://github.com/Priyansh19077/Dyna... Practice Problems: Problem 1: https://codeforces.com/problemset/pro... Problem 2: https://codeforces.com/problemset/pro... Connect with us: TLE Website: https://tle-eliminators.com/ TLE Community:   / discord   Instagram:   / tle_eliminators   Linkedin:   / tle-eliminators   Connect with Priyansh: Linkedin:   / priyansh-agarwal   Twitter:   / priyansh_31dec   Youtube:    / @priyanshagarwal   Other content worth checking out on this channel: 1. Post Contest Discussions of Codeforces contests:    • Codeforces Contest Solutions   2. Competitive Programming tricks:    • Competitive Programming Tricks   3. Our launch videos:    • New Launches   Timestamps: 0:00 Introduction 0:29 Understanding the problem 1:39 Breaking into smaller subproblems 5:44 Constructing DP solution 8:50 Time and Space complexity 9:56 Something very important 10:49 Let's look at the code 13:30 Thank you for watching