← Questions
Maximum coins from k consecutive bags
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Bags stand at every positive integer position. Each segment [l, r, v] says every bag from l to r holds v; segments don't overlap and all other bags are empty. Choose k consecutive bags with the largest total and return it modulo 10^9 + 7. Work with the segments rather than with individual bags.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding