That's awesome, thanks!

This appears to only be an issue with the sample tests (the full tests have gen15 = choose (0, 15)). My recently published fork fixes this in the sample tests.

My recently published Haskell fork adds a test case to eliminate these kinds of solutions.

Haskell fork with the following changes:

• Minor tweaks to the test suites
  • Qualified imports from solution module to avoid inadvertent name clashing
  • Replaced choose with chooseInt
  • Improved the generation of random lists of powers
  • Removed unused code from sample tests
• Updated sample tests to use proper ranges, resolving this issue
  • The full tests already used the proper ranges
• Added test in full tests to weed out solutions that use a fixed result for field multiplication, resolving this issue

Test cases are unacceptable for a 3 kyu: this solution should not be able to pass

See this paragraph and this paragraph for explanation.

Code is passing tests but failing the Attempt. I didn't even know that was possible, and can't understand what's happening.

Seems to be the oldest thread here from ten years ago, but I don't see it resolved in the code.

Please correct me if I'm mistaken:

The maximum degree of our polynoms will be smaller than 16.

In the Haskell property test suite though there is gen15 = choose (0, 16) which generates polynoms x^16 as the range of choose is inclusive.

Same issue here

Dear Smileous,

The logic of your algorithm is quite right, it would generally work absolutely the same way as kanonical BWT, the difference is in the fact that canonical BWT should be expected to work not with letters of text, but with bytes and their values where character 'a' and 'A' are quite different letters having different ACII code values, while your algorithm implement some default C# comparison method with specific comparison logic.

In order for you to fix your code you shall try to adjust default for C# sort order and to ensure that texts are sorted based on ACII codes of relevant characters.

I assume that remark regarding sort order would be useful in KATA Description, but it is absolutely not mandatory, and would be not fare to consider it to be KATA issue.

Well, thank you for your feedback. It fills me with joy that even years after I created them, people still spend time completing them. Also, thanks to all the translators.

Very funny and interesting Kata! Thanks to author!!!

CyclicRef is unneeded in JavaScript, no? I don't even think the translator's used it.