how about now?

fixed

you can republish the kata now

fixed, thank you

sample tests to be precise, you did not import assert from chai

Oh my! Good spot. I blame the human in the loop. Fixed. Thanks.

True. I changed the description.

The built-in function max does exactly what is required: return 1 as a minimum. However the wording 'max', I thought could be clarified a little bit more: what is required
for specifying the stack would be a bound, that is between 1-->floor(1/10 * n) and 1-->floor(1/2 * length(list_one)). 'With two or more arguments, return the largest argument' is how max is specified in Python's help doc. However, the word 'maximum(floor(1/10n),1)' could be interpreted as a ceiling of 1 or floor(1/10n); so values like 0.9 or 0.8 are permissible. I am talking about the general specification of the problem for someone who is not familiar with the function max(). So I decided to word it as greater(floor(1/10*n),1) to explicitly specify that 1 is a lower-bound.

duplicate issue

I believe numbers like 20 should also fall under this category, as their first and last digits are the same once padded.

You're right. Thank you. I have updated the kata to only cover 3 digit numbers where first and last digit differ by at least one.

Yes and that is because I am a numnnutt who forgot I have to make a fork that have to be approved again.

If you read the question carefully, it says students in graduation status, there is no question of being less than 8 semesters.

Correct. I was 1 off on an index.
Fixed!

Fixed