in the medium pyramid this the path : 75+64+82+87+82+75+73+28+83+32+91+78+58+73+93 = 1074
for example in 32 value is there 9 possible paths or 4 paths ?

CoffeeScript translation

Kata is fun and really perfect, but what about time complexity? My code works for O(n^2) like (n + 1) * (n / 2) if n is the length of last row. But is there solution faster?

'down' is misleading.
also its not greedy/local max, its global max

Wouldn't it be better to add in the description that the correct answer for middlePyramid is 1074 not 1064? As many people thinks it's an issue it would laso be good to add some hints like that it is based on "Greedy algorithm" or that you should use dynamic programming technic to solve it? I understand that it is good practive to look for an answer however in order to catch a fish you need a fishing rod first.

My code works fine for small and med pyramids but for large pyramids it says execution timed out (12000 ms) I am new at coding so i understand my code is not so efficent. how can i optimize my code

Go Translation

D translation

• Ruby 3.0 should be enabled (Refer this & this for more detail)

• Node 18 should be enabled (Refer this and this for more info)

• Ruby 3.0 should be enabled (Refer this & this for more detail)

No random tests in Ruby