It might be a good idea to include this crucial tip in the instructions for this awesome kata: "Brackets must be matched based on their nesting level. This means you can’t simply jump to the next ]; instead, you need to track the depth of nesting to locate the correct matching bracket.

Could anyone please point me (pun not intended) in the right direction? What sort of material and topics do I need to learn before being able to solve this? (C++)

hi! first 3 test is working, 4th is working on visual studio, but i constatly get 'IndexOutOfRangeException' for the 5th test. Nonetheless, it is still unclear what to to for ',' if input is empty?

This thing broke while loops.

I decrement var i in while(){}.
When it reenters while, (because of the condition) i is the value before.

The increment is somewhere far below the while loop.

So ladies and gentlemen...

In one of the tests I get the following

Expected: equal to "1, 1, 2, 3, 5, 8, 13, 21, 34, 55"
actual: ""

How am I supposed to guess where the problem is? How should I understand which Brainf**k language command was used? How should I understand whether the string was supplemented with some characters or not (unless, of course, I need to know this at all)

Your options, dear)

For c++ the first testcase is ,+[-.,+] this calls , on an exhausted input

Kata Update

• Update to node v18.x
• Used chai for assertion
• Disallow require

I don't understand the task. The inputs are string of code that does xyz, I understand. Byte array from the String also given as input which you use only when , code is reached?? Everything else, I don't. Am I supposed to initalise a byte list/array and use this with the data pointer? Or is that from the String input??

[Clojure] Description says to assume that , will never be invoked when input stream is exhausted, but there is a test for "insufficient input" that is just "," with an empty string as input.

Nasm translation

(Brainfuck translation): No (proper) random tests.

Additionally, the rank of BF translation of this kata is too low, it should be at least 4kyu. This probably has not been noticed before, because except for one other solution besides mine, ALL solutions (including the reference solution) are direct copies from someone elses work on an external website. A BF version of this task should be standalone, and should not be designed to perfectly match an existing online solution, just so that the reference solution can be lazily copied.

This translation should be nuked.

The description says:

"Your memory tape should be large enough - the original implementation had 30,000 cells but a few thousand should suffice for this Kata"
and:
"The memory pointer should initially point to a cell in the tape with a sufficient number (e.g. a few thousand or more) of cells to its right."

However in C# at least, no test case requires more than 15 memory cells. Even if using the same memory tape for all tests without ever clearing it or winding it back, only 24 cells are needed. If this is intentional, the description's references to requiring thousands of cells should probably be changed