Interesting...

Manual notification.

who can explain this solution please?

(((code.indexOf(e) + 1) * Math.pow(2, i + 1)) % 67 + 66) % 67
can't believe, how did you find that long long fomula?

It looks cool

I agree, I'm still unsure of what's being asked. Maybe include an description of how you expect a chocolate bar would be broken assuming both dimensions are >1? I think that would help.

Came here to say this.

In all the other options the increment determines how many items are returned in the array. Giving three 1s is just pretending that you're incrementing by 1 but not stepping up. Where does the increment of 1 come from?

The same, kata is easy, but it took a huge amount of time to understand what is going on here...
One example could have explained more than thousands of words...

What's the advantage to doing every single character yourself rather than passing the entire string to the Buffer?

I agree with this. If this hadn't been ranked at 7 kyu, I would have spent a long time working out how to optimally break chocolate in as few "operations" as possible. Clearly that turned out not to be necessary, but I shouldn't have to guess that based on the rating.

.split("").reverse() could have removed some complexity.

Nope, sorry, I am still receiving the exact same error messages.

Fixed!