if (codewarrior[c1] > opponent[o1]) {
                    win++;
                    c1++;
                    o1++;
                }

this line is redundant in your solution
you just need the second if

Super slow solution, this is a good function but not fit for this exercise.
Thanks for sharing.

Absolutely, harderst 5th kyu Algorithm i ever did by quite a margin actually.
I did not use regex, it was insanely hard, almost like i was writting an A.I lol.

Thanks for your solution, i did the same way but with a hashmap at first, which cost me a lot more operations.

Hello, i have returned to this Kata and subsequently i must apologise for my impulsive critique.
I simply didn't realize how it could be done because i am a bit new to Java algorithms.
I did not really find this Kata too difficult, about as difficult as other 6th Kyu, but i will surely take my time to see other solutions and also JoJoSmith10 shared article which proved very interesting at face value.

Don't waste your time with this kata, it seems interesting, and with more intuition to the problem it could have been a pretty fun 6th kyu Kata.
But you can find plenty more friendly Kata that cover the same subjects.

No indication is given on how to distinguish tail from loop.

I did misread it, lower than 0 it says, weird, i did not include that and i passed the tests.

Hello, i am sorry, my mistake, the conditon was >12 not == 0 || >=12, did i misread that i had to include == 0?
It was Java and it works.

Interesting way of reversing, i don't agree that it wastes cpu, i understand that you are creating an extra set of bytes with the result string but in this case i don't think it is very expensive.

This kata is broken, after i unlocked solutions those still don't pass.

My solution has slightly better performance than yours, and i did not care to refactor it, i put screws all over it, i guess an actual parser is better than regex.