Codeforces Round 930 Editorial (A, B, C) | Saptarshi Mukherjee
Автор: Decipher Algorithms with Saptarshi
Загружено: 2024-03-03
Просмотров: 510
Hey folks, 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.
Timestamps of the video:
00:00:00 Introduction
00:01:18 Understanding Problem-A
00:04:30 Reaching solution to Problem A through observation
00:06:50 Coding Implementation
00:07:35 Understanding Problem-B
00:09:52 DP idea and the limitations
00:14:34 Intuition Building for Greedy approach and discussion of all cases
00:25:22 Coding Implementation
00:29:25 Understanding Problem-C
00:33:38 Discussion around Divide and Conquer
00:35:19 Intuition Building with classical techniques
00:40:00 Trick to find Max element
00:41:49 Trick to find the possible partners for Maximum OR
00:46:52 Final Trick to find the single best partner for Maximum XOR
00:48:18 Summary of the procedure (Check my implementation here: https://codeforces.com/contest/1937/s...)
00:52:11 Summary of the problems and Closure
Please like, subscribe, and share with folks who may find it informative! See you all in the next videos!
Codeforces: https://codeforces.com/profile/saptar...
Linkedin: / saptarshi-mukherjee-52660616b
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
