simple and nice solution

so simple yet i could not think of it

lol

Damn I came so close to this solution but couldn't completely figure it out.🤦‍♂️

great

same solution

I agree

['<','='][n==0]
That was impressive.

For me that's the more usual way.

Do you mean string concatenation?

You might have run into an infinite loop.

https://lmgtfy.com/?q=regex+isogram
kek.

How is the last return cunstraction called?

Looks good.

Does not work for test case:

var leftBranch = new Node(1,undefined,new Node(2, undefined, new Node(3)));
var rightBranch = new Node(1,undefined,new Node(2, undefined, new Node(3,undefined, new Node(4))));
var newTree = new Node(0,leftBranch,rightBranch);
Test.expect(!allLeavesAtSameLevel(newTree),'Should return false for a tree with leaves at different levels');

Hi, my honor has dropped from around 135 (can't rememeber the exact number) to 68. This happened after the site seemed to hang when submitting a solution, so I shutdown the browser and reloaded the page.