Feel free to watch in 1.25x if you feel the need.
Problems E, F, and G are must-try for beginners. Each problem teaches a commonly used concept.
Especially problem G tests your fundamental understanding of the Dijkstra algorithm.
This is an experimental video editorial. I would look for feedback on whether video editorial is useful or not.
This video explains the problems E, F, and G of Codeforces Round 918.
Contest Link - https://codeforces.com/contest/1915
My submissions links
Problem E - https://codeforces.com/contest/1915/submission/239253198
Problem F - https://codeforces.com/contest/1915/submission/239286485 (We don't necessarily need Fenwick Tree here)
Problem G - https://codeforces.com/contest/1915/submission/239300005
0:00 Introduction
1:04 Subarray Technique | Problem E
6:18 Interval Technique | Problem F
12:10 Understanding Dijkstra Better | Problem G
Mouse I use - https://shorturl.at/hloAX
Keyboard I use - https://shorturl.at/elFHX
Microphone I use - https://shorturl.at/hpT13
