Based on what algorithm should the position of the letters be changed?

Node 18. should be enabled

Description should be language-agnostic

Lua translation!

Nice Kata!

But there should be some test cases with booleans outside of random cases as my solution passed all the tests with no check for booleans

Rust translation

RISCV Translation

Re-raising the issue: this kata is a duplicate of https://www.codewars.com/kata/52fba2a9adcd10b34300094c

It's a good kata.
But it have to have a more clearer description, that suffixes are calculated based on the word and not static.
In my case I've understood that the example values are static.
So I've lost the solution thread and gave up on the task.

What do you think?

JS: missing sample tests

JS at least: the random tests generate weird situations that aren't described and where the exact order of the operations matters:

4^620 =5//*54+7= 6=*
4 /*12=8**/=3 94-3^9 
10 4^//181 

note: shouldn't we just retire the kata? (or are there plans about it?)

• Rust translation
• Go translation

• Rust translation
• Go translation

Ruby 3.0 should be enabled.

• Python new test framework should be used (Refer this & this for more detail)

• Ruby 3.0 should be enabled (Refer this & this for more detail)