← Questions
Zipline between two trees maximizing height times span
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Trees stand one unit apart with heights heights[i]. A zipline joins two different trees at one height, no higher than the shorter tree. Its value is that height times the distance between the trees. Return the best value, faster than checking every pair.
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