← Questions
Cutting ribbons
0
I was asked this
No reports yet. Sign in to say where you were asked it.
You have pieces of wood (or ribbon) of given lengths and need k pieces of equal length; you may cut but not join. Return the longest length that still yields at least k pieces. Binary search on the length, counting pieces for each guess.
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