← Questions
Fewest sum-replacement steps to reach a target array
0
I was asked this
No reports yet. Sign in to say where you were asked it.
An array of fixed length starts with every element equal to 1. One step replaces one element with the sum of the whole array. Given a target array, return the fewest steps that turn the all-ones array into it, or -1 when it can't be reached.
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