Codeforces Round 930 Editorial (D, E) | Saptarshi Mukherjee
Автор: Decipher Algorithms with Saptarshi
Загружено: 2024-03-03
Просмотров: 632
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:07 Understanding Problem-D
00:07:12 Crucial primary observations for intuition-building
00:14:25 Why I couldn't complete it during the contest
00:16:25 Thorough mathematical deduction to evaluate the answer
00:29:46 Finding the sum of relevant elements/positions using Binary Search and Prefix Sum
00:35:55 Code with good Implementation practices
00:41:25 Understanding Problem-E
00:48:27 Relevance with Shortest Path problem
00:49:33 Crucial observations to eliminate complexities
00:59:32 Edge explosion while trying with n pokemons as n nodes
01:01:36 Different graph structure based on observation
01:03:17 Detailed Graph Construction and solution discussion
01:14:56 Coding implementation
01:20:08 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
-
Информация по загрузке:
