← Questions
Remove k consecutive machines to minimize strength differences
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Machines stand in a row, each with a strength. Remove exactly k consecutive machines so that the sum of absolute differences between neighbouring strengths in the remaining row is as small as possible, and return that sum.
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