Thanks 👍 Approved.

Code golf restriction: maximum solution length of 38 characters.

limit = 38

# ...

test.expect(size < limit, f'Solution too large')

1. https://www.codewars.com/kata/reviews/673c9338222dde58f86b50f8/groups/673c991f9f511a10bbc090bb

2. The code length must not exceed 30 characters.

   Maybe you mean, must not reach 30?

1. There's already a kata about bubble sort: https://www.codewars.com/kata/57403b5ad67e87b5e7000d1d
2. No random tests

1. Initial solution doesn't compile correctly because
   
   a. The function is not exported
   
   b. The return value is a non-existent variable
2. Tests feedback were very unhelpful:

     expected [ Array(9) ] to deeply equal [ Array(9) ]
   

Java: Since the second item of the array is just a character, why not expect a char instead of a string?

Ayy, you're the first solver of the kata. Congrats!

I'm glad that you liked it :)

Side note: If you want to try more katas about TS types, you can take a look at this collection I made a couple months ago.

I've made a new random tests code for this kata. Hopefully, this one is more reliable on the value retrieval and assertion than the previous one.

Let me know if there are issues with it :)

Hi, I just checked it, and there are some issues with it:

1. There's no need for 29k random tests, 100 - 500 should be enough. What you need to focus more on is adding more random tests for edge cases like range out of bound, zero changes, and stuff like that

2.  expected:=switches
    solution(&expected, on,off,toggle)
    ControlSwitches(&switches, on,off,toggle)
    Expect(switches).To(Equal(expected),"inputs %T(%d) \"%s\", \"%s\", \"%s\"",switches,switches,on,off,toggle)
   

   I suggest that you store the switches for the input on another variable like the expected one, as when the result is wrong the input switches displayed is the same one as the one the user has changed / modify.

3. Add some description for the Contexts and Its

memory[memIndex] == 0 ? leftBrackets.pop() : i = leftBrackets[0]

i = leftBrackets[0] is wrong because, again, the latest bracket is the last item of the array.

Hi, sorry for the long reply. Looks good to me now. You just need to add random tests.

In the memory cells usage checks:

memory[memIndex] == 0 ? leftBrackets.shift() : i = leftBrackets[0]
if (leftBrackets.length == 0) {skip = false}

The first line is wrong as the latest bracket is currently on the last index. The second line is also wrong as when the code is something like this: +[-[-]>+<]>. this will result in 0 instead of 1 since the state skip from inner bracket still holds.

1. You should use chai for assertion. See this: https://docs.codewars.com/languages/javascript/mocha
2. There's only one random test

1. You should use chai for assertion. See this: https://docs.codewars.com/languages/javascript/mocha
2. There's only one random test