literally the first line

string[] delimiters = new string[] { " ", ",", ".", ":", "_", "-", "/", "", ";", "!", "?" };

these are not the only delimiting characters, you need to split on everything that isn't in [a-zA-Z] and '

Write a BF interpreter which according to the test comment // Echo until byte(255) encountred it tries to run this BF code ,+[-.,+] on a string Codewarsÿ which copies Codewars to the output, stopping at ÿ.

edit: ÿ is only what you might see in a hex editor where the byte is 0xFF, and it appears here. 0xFF a.k.a. 255 is what really matters, because the 2nd + BF instruction increments it, and it wraps around to zero, so the following ] instruction advances to the end of the program instead of jumping back to the [ instruction and running the loop again.

edit++: I mean 'jumping back to the next instruction after ['. I don't really know BF.

whatchu talking about man

LMAO

so in C# string iterpreter thing "Codewars"+char.ConvertFromUtf32(255) specifically convert from utf32 returns this character ÿ and in total string is Codewarsÿ so what the heck should i do with this XD, thanks =)

Clever but slow nested loops would make things faster i think... TC of this is O(nLog(n)) and TC of nested loops is O(n^2) but clever solution and quick ngl...

tbh yeah TC is O(nLog(n)) and SC is O(n) when it can be done with nested loops with TC of O(n^2) and SC of O(1) but seems like less code

Well this code has worse TC and SC but I like it, less code buff i guess but may i ask is TC O(n log(n))? cause it uses OrderBy and why use Queue?

I so adorse your affort into this man XD

read inattentively. I'm sorry

The ISSUE label is for provable kata issues. See https://docs.codewars.com/training/troubleshooting/#post-discourse.