[challenge] minimum moves to make array[i] - array[j] equal to K

Question

Each move you can change one element of the array.. you can change to anything. you need to make the array difference by K for each adjacent element.

for example
K = 2 array = 1 2 5 7 9 85 so the move are 2

we can change 2 to 3, and 85 to 11

what we got after it are 1 3 5 7 9 11

do in any language you can

Answer 1

bump

Answer 2

Momo Belia no need to bump sololearn threads dw