Or you just do the math to compute this formula.

Don't get what you want to say?

[1].sameStructureAs([1])
true

This solution does not work correctly. If we use the option [1].sameStructureAs([1]), it will return false.

i see it. cool thanks!

Click on View Solution under this post, I've written a recursive solution for you to see it.

i saw recursion tag, so i thought we had to answer this with a recursion solution. Thanks for the reply! what would the recursive solution be? i am trying to practice recursion.

This is not a recursive solution, recursive functions call themselves and it's not the case here.

are we suppose to answer this kata with a recursive solution? Is this a recursive solution? i cannot tell

how do people come up with these algorithms???

I like how Best Practices and Clever buttons are useless cause here we see ppl think using eval (which is banned/discouraged everywhere) is kinda cool.

sum is not an array, but a function. Because it's called twice on each comparison during sorting, you may end up with some numbers having their sum calculated multiple times.

Why? As I understand it, the sums for each number are only calculated once. During the compare the sum array is only referenced.

That's facinating!!