@Bliuss

You will not always get the highest sum by always picking the highest of two values.

Can you please explain why? Is there is more than two ways available in each line of the pyramid? If its not, then why adding a bigger number dont get you bigger sum in the end?

Edit: oh, i got it, sorry.

You should try this data: [[1], [2, 1], [1, 2, 3, 99]] ,and you will find where is wrong.

Same. I have done this 5 or 6 times now and it always gives me 1064. This makes me so upset cause I hate skipping problems.

Am I missing something here @whythat?

Where did you see that the focus is about square root? or about squaring ? The question is to see if the two arrays are "the same" and it is up to you to find a code for that.

Tests are the same in all languages and 7919 guys passed the kata. Something is wrong in your code:-(