As mentioned below: there are already approved katas on BWT.

IIRC there's another kata around that is about the same thing.

Actually, the problem isn't mine. It was first given on the national phase of the informatics olympiad in Romania in 2015. And because I hadn't seen it on this website and i thought it was such a nice problem when I first solved it, I created a new kata with the english version of the problem. Original: https://www.pbinfo.ro/probleme/1219/cript

Yeah. It actually is pretty similar, but Burrows-Wheeler-Transformation is like havin a matrix for the entire text, while this is for every character and it's in base 2. Other than that, yeah, they are kinda similar.

This seems very similar to https://www.codewars.com/kata/54ce4c6804fcc440a1000ecb

How do I do that? It's my first kata ..

I will modify it to 1000.

Ok. I will try to fix all the issues. Thanks for helping out!

The reference solution should be in a Describe block.

Initial solution should use const std::string & as the parameter type for both functions.

The user can modify the input.

No fixed tests.