We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
"Nina received an odd New Year's present from a student: a set of unbreakable sticks. Each stick has a length, l, and the length of the ith stick is l[i-1]."
So... every stick is as long as the previous stick... which makes them all the same length. The answer to this problem is literally a constant 0, because 6 equal lines do not a square make.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
New Year Present
You are viewing a single comment's thread. Return to all comments →
"Nina received an odd New Year's present from a student: a set of unbreakable sticks. Each stick has a length, l, and the length of the ith stick is l[i-1]."
So... every stick is as long as the previous stick... which makes them all the same length. The answer to this problem is literally a constant 0, because 6 equal lines do not a square make.