This doesn't prevent calling it on non-tuples. Otherwise, this is essentially the right idea (and will work on the version of TS that's available on Codewars).

Unfortunately, it seems like several old kata are incompatible with >2.x and they are uninterested in updating until they are updated:

https://github.com/codewars/runner/issues/188

(Edit:) I added a note in the description that it should reject non-tuple inputs.

You fix the bug, but there is a new bug.

I like the way this solves the problem. Switch/case is such a bulky syntax, and this cleans that up nicely.

I added an error message if "this" is not bound.

This function must be called directly (callStack.validateSize()), or with the callStack context bound!

I ran into this, but it being opaque, I wrote it off as probably having done something wrong myself ( I was doing wrong plenty ). In a later attempt it was not a problem - because I accidentally was in the correct scope.

Should be simple enough to fix by passing user a function bound to the correct context. ( Famous last words .. )

Thanks! This should be fixed

The string check should be separated to provide clearer assertion messages.

Probably should increase the number of random tests, my semi-bruteforce solution managed to pass with enough attempts.

I'm having more success with a greedy approach, so nevermind I guess.

Am I incorrect in assuming Bron–Kerbosch algorithm should work here? More likely my implmentation is incorrect, no?

@Talrendis Haha, nice one xD

haha, around 600 tests are fine and 100 are wrong for my solution.
I use kinda greedy algorithm.
I dont think bruteforce will pass...

Can anybody give me a hint? Because im really excited about the kata.
The description is short and clear, however the task is non trivial for me.
And, of course, my favourite graph theory <3
So really looking forward to solving this, but I just dunno how :(

Anyways, awesome kata!