Mind sharing which tool did you use for that? Since writing FSM is pretty easy however manual conversion doesn't sound appealing.

I know you already solved. But this solution is clearly invalid.

I can send you my DKA, builded for this kata, Bibik is my second account
I have been solving this for 5 or 6 days, dont you see this???

While it's true that there's many cheating solutions for this kata, this particular user solved it in a legit way before 'experimenting' with this workaround.

More cheating

C̷h̷e̷a̷t̷e̷r̷ . Then I take it back. Pardon me sir.

It was cool.

Thx.

i should equal 1, there is no reason to compare arr[0] to itself.

O(nlogn)

Just wanted to fix the tests and try this kumite thing oout ;)

It goes to minus infinity, math logarithmic expressions look if you want

You are laughing at me, but thanks.

Only if you solve Regular Expression - divisible by n in a proper way later tomorrow.

But come on, I converted DFA into answer for this kata manually, and got it right after 5th or 6th try, so it's not that hard ;)
Later it turned out that expression generated by the solution to the other kata was half of its length :?

I have a question: I made a state machine on my piece of paper, but I really don't want to manually convert it into a regular expression. Can I consider the kata completed if I use a third-party transformation tool?