Hahahaha

Great! hows that?

<r>It doesn't work either :s (had to do a small tweak to make it work since it has an issue with edge cases like no ropes passed in, etc), it is correct but has scalability issues. if you want to play around (and get detailed outputs) you can go here <URL url="https://codility.com/programmers/custom...

Thanks for your response! it is quite similar to my algorithm (see attached code). Anyways, I tried submitting yours and it also has the 'scalability' issues and didn't get the 100% score :s ... I cannot think of a better way of solving it

<t>In a room there are N ropes and N weights. Each rope is connected to exactly one weight (at just one end), and each rope has a particular durability − the maximum weight that it can suspend.There is also a hook, attached to the ceiling. The ropes can be attached to the hook by tying the end witho...

<t>Hey guys, was able to solve the challenge but only got the silver award, the detected complexity of my algorithm is O(NlogN) but it seems to have some scalability issues. Could you give me some hints on how to make it more efficient? (didn't quite understand how to apply the fibonacci to this par...