Extremely strange test results - [0, 2, 2, 0]: it returns [2, 2, 0, 0] for me - the test writes that it is not true and should return [2, 2, 0, 0]. What's wrong here???

Difficult to understand explanation. Tell me, do we remove W <-> E or S <-> N only if they are near? That is, in W, E, W, S, E, do we delete W and E? And there remains W, S, E?

return digital_root(x) !!!!!

Teach me, I haven't studied this yet)))
Tried:
return x
return n
but the result is the same

thanks, got it!

Thanks, I read it. In the test case, the error is thrown:
'selbamiunefiwnemvcvnaknlhmzmskqrdplbqsxmqooegeqvnpdyjpzltdtpxysnavoqcwgltgvususdrzlfmpvwmckcwntvcqbd' should equal 'SELBAMIUNEFIWNEMVCVNAKNLHMZMSKQRDPLBQSXMQOOEGEQVNPDYJPZLTDTPXYSNAVOQCWGLTGVUSUSDRZLFMPVWMCKCWNTVCQBD'

From the assignment, I realized that a minimum of actions are needed. That is, if all letters are lowercase, you need to keep them in lowercase. Right?

Thanks! I realized my mistake, it remains only to somehow implement my correct decision)))

Anyway, I don't understand a little: I loop through the list, find all the elements that are greater than A [i], then add their indices to a separate array and from there I pull out the minimum ...