Maximum Sum Obtained of Any Permutation - A visual editorial | LC Biweekly 35 | Difference Arrays
Link to problem: https://leetcode.com/contest/biweekly...
Link to discussion thread: https://leetcode.com/problems/maximum...
The central concept of the problem is doing constant time range updates per query.
Link to CF blog with this concept: https://codeforces.com/blog/entry/86420
Link to CF blog with more generalisations by peltorator: https://codeforces.com/blog/entry/88474
Awesome video by peltorator on advanced versions of the same topic: • Префиксные суммы, разностные массивы и сил...
This is a visual 3Blue1Brown styled editorial for the problem Maximum Sum obtained of Any Permutation from Leetcode Biweekly contest 35.
The video begins with the approach, then the code is explained and finally concluding with visualization of a test case with the code by its side.
Be sure to subscribe and press the bell icon if you're interested in watching similar editorials in the future. If you want, you can also follow on social media (links in about section)
Timestamps:
00:00 Intro
00:07 Problem statement
01:44 More overlap implies more weight
04:04 Doing range updates in constant time (core idea)
06:02 Code for const. time range update
06:19 C++ and Python code for the main problem
07:14 An animated running example