DP + Prefix Tricks | Buy and Sell Stocks IV | LC Hard Problem | Codeforces Round 932 Problem C скачать в хорошем качестве

DP + Prefix Tricks | Buy and Sell Stocks IV | LC Hard Problem | Codeforces Round 932 Problem C

Hello everyone, I'm Saptarshi Mukherjee, a Software Engineer III at Google and a Competitive Programmer with some titles like 3 times ACM-ICPC Regionals, Former Master at Codeforces, and 6 star at Codechef, Former Educator and Mentor at Unacademy, etc. This session is on a very frequently appearing topic on CP contests: DP + Prefix Tricks. Please share with your friends who may find this informative. 00:00:00 Introduction 00:00:10 DP topics in contests 00:01:54 About "DP + Prefix Tricks" 00:04:15 Best Time to Buy and Sell Stocks Problem Hard Version 00:06:57 Reaching DP Formulation through examples 00:14:10 Optimization of DP Formulation using Prefix Max 00:15:53 My Coding Implementation 00:20:54 LC Hard Problem: Maximum Strength of K disjoint subarrays 00:25:44 Reaching DP Formulation through examples 00:40:13 My Coding Implementation 00:44:02 Codeforces Round 932 Problem C: Messenger in MAC 00:48:28 Discussion of Solution Approach 00:49:29 DP Formulation 00:55:58 Rectifying an issue: small yet significant difference from previous problems 01:00:40 My Coding Implementation 01:03:45 Closure See you all in the next videos! Codeforces: https://codeforces.com/profile/saptar... Linkedin:   / saptarshi-mukherjee-52660616b