Yeah. But when I first read it, it sounded like you can't have repeats. IE: if there as enough 1s for a triple, u couldn't also score singles from more. Re-read it a few times, and it made more sense. Seemed incorrect at first.

You can get 1100 points when you roll exactly four ones (for example 1-1-1-1-2). Three ones will give you 1000 points, and the fourth one will give you 100 points.

The test cases are wrong for this problem. The description states a dice can not be used in a triple and a single in the same roll. But the 1100 one is only possible if the 1 is counted in both the triple and the single.

This was not fun. For more experienced python people, it was probably easy. No way of guessing at the solution on this. Even after seeing the solution, not sure I get it still.

I don't say that it's the best description in the world, but to me it's quite clear that it wants digits in a descending order, and not numbers in a descending order. And it is the same as getting the highest possible number.

Would you have an idea for a better description?

Not your fault. The problem is written wrong. The first statement says to put them in reverse. The second statement says to re-arrange to get the biggest number.

This problem is misleading. It states to print out the numbers in descending order. That is false. What it is asking is to rearrange the numbers to get the biggest number possible from the number put into the function call. The first and second statements of the description are contradictory. The output fails if it doesn't completely re-arrange the numbers to get the biggest number.