You need to search in the given number for the smallest digit, in "261235" it is 1 which is in position 2 or in index 2. to make "261235" smaller I take 1 and move it to the beginning to position 0 obtaining 126235. then my answer is [my smallest number, the index from where I got 1, the position where I put it in this case 0] = [126235, 2, 0]

hehehee same.
and thinking while I was implementing my huge repetitive code with uninon
"there's no way there isn't a better way to solve this"

what was an error in your code?

if the number of elements in the list is even, the median is the average of the center two elements.

The tests work okay, and the problem comes from your code. The error messages are not clear indeed, but that's the problem with the runner, and not with the kata.