Cool 😎

oh..I never know we can assign multiple name to function :O

wow

can you explain this code please;

Well, it definitely seems to pass all the tests. :]

This kata is turning out much more interesting than I imagined when I first clicked on it. There are just so many different solutions. And you may have found the simplest. I don't think it can be done in less than three comparisons.

Yes, it is more clear for me now.

oh I see, is it ok now?

I read it as "no (repeating or zero integer roots)". Also "zero integer roots" reads like "it should have at least one integer root".

I don't get it, the current description already states "integer roots"

Description was not clear for me. I would suggest to change it to

Let's call this polynomial compact if it has only integer roots which are non-repeating and non-zero and ...

Currently it sounds like real and complex roots are ok.

Try not to use floating point arithmetic.

Guys,
I thought I understood the problem well and found the proper solution to it.
(JS)
At that, while my solution always passes complete set of "small" random tests, it fails the 1st "big" test.
Can there be something wrong with JS "big" tests or I am really so stupid on Friday morning :) ...

really bro