Why is this O(NlogN) | Codeforces Round 1102 | Video Editorial | ABCDEF

Codeforces Round 1102 Solution Discussion My submissions - https://codeforces.com/submissions/ar... Telegram - https://t.me/aryanc403yt Community discord server -   / discord   LinkedIn -   / yt403   Twitter -   / aryanc403   Instagram -   / aryanc403yt   Chapters - 00:00:00 Testing 00:04:55 A. Euclid, Sequence and Two Numbers 00:18:35 B. Palindrome, Twelve and Two Terms 00:33:55 C. Vessels, Heights and Two Versions (Easy Version) 01:28:00 D. XOR, Expression and Two Binary Numbers 02:01:00 F. Vessels, Heights and Two Versions (Hard Version) 02:36:00 E. Vlad, Misha and Two Arrays 02:57:00 Time complexity for E - Why is this O(NlogN)? 03:10:00 Chat QnA Tags - #icpc #ioi #codeforces #codeforcessolution #codeforcessolutions #codechef #codechefsolution #codechefsolutiontoday #atcoder #geekforgeeks #topcoder#hackerearth #hackerrank #hackerranksolution #hackerranksolutions #leetcode #leetcodesolutions #leetcodesolution #leetcodecontest