Either I underestimated this kata going in, or this kata was on the more difficult end for 5 kyus. Either way, this was a pretty good kata and I enjoyed the challenge.

apologies for the late response, but it should be fixed and working properly.

That is true, i hadn't had much experience with Rust when making this problem and i was running into issues just passing in Vec<i32>. Now I've looked back at it and realized it's an easy change.

suffering for what...

In the instructions, it states that only known guests and members (1 and 2 respectively) can "cut" in front of the others, meaning they get sorted to the front, while everybody else has to maintain their position in line. In [1,1,3,2,0], all the 1's and 2's get moved to the front (the two just gets moved in front of the 3), while everything else maintained their position in line (0 remained at the end since it isn't sorted).

You have to create the algorithm to swap it. You sort it so that it has the proper order for you to be able to swap correctly. Re-read the scenario and take a look at the step-by-step examples underneath.

fixed

approved, appreciate the translations

looks good. merged.

merged

cannot merge translation. re-fork and publish, copying the current problem description, and apply the changes

fixed

How about instead of quoting part of the sentence, you can quote the entirety :)

"You are given a list of the people that are waiting in queue, each numbered 1-3 except you, who is 0, and "unknown guests", which can be any other positive number."

Which is proven within the example.

moved

i believe that I have solved all the issues mentioned here.