very useful, thank you so much

Nice regex. Tbh, I thought we were going to hard-code a finite state machine of the "binary multiple of 3", but regex is nice too.

The task is to create a regex that can be used to check whether a string is the binary representation of a number divisible by 3, not a function.

The regular expression should not use the g flag.

Chai uses re.exec when it tests a regular expression re. This regular expression matches '000' and its lastIndex is set to 3 (because the g flag is set). The next test calls re.exec('110'). The match starts from the new lastIndex position and it fails.

There is something weird indeed with the tests, if you only leave that one in the sample tests, your code passes it. But, your code is not ok, and it returns true for any combination of 0 and 1 with 3 digits.

Test failing even though it is a match when I console.log the test using

multipleOf3Regex.test('110')

My solution is

const multipleOf3Regex = /^[0-1]{3}$/g

kata hint != kata suggestion

Remember about the 6th rule!!!

I spent approximately 2 hours only because I am so stupid I did't notice the 6th rule.

Using global variables is your mistake, and not a kata problem. Code with global variables will work incorrectly everywhere, and not only on Codewars.

ahh I solved it, the kata don't count the global variables so I put it to the function and it works correctly. waste 2 hours to discover that :(

I attempted my code on a compiler with case 'D',3 and it return 37 but when I attempt in the kata it return 30 instead. what's the problem??

ok, this was a pretty good challenge.
I took a while to get it what's going on.