I think I understand how this one works. Would you mind breaking it down a bit for me?

haha, this is fantastic. It would be a relatively quick process as well.

So I think I have a good grasp of the problem, the part I'm struggling with is parsing the number into manageble pieces. I can check if each individual number of xyz is prime, but I'm having a harder time checking if either x is prime and yz is prime, or xy is prime and z is prime. I can hack something together, but I don't think it's going to work once I reach numbers in excess of 3 or 4 digits. I could put together and absolutely massive if:else tree, but that seems non pythonic.

I can't seem to get this solution to work. I copy pasted it, and it still produces roughly random orderings of the result.

Ok, someone help me out with how they walk through the process of sorting the list into pairs. I don't need the code, I can write that part myself, but I'm struggling with the conceptual method.

I reread and caught that the second time. Super easy to solve once I got that.

Nevermind, I get it. It should be every integer in range.

I'm struggling a bit to identify the criteria for how integers should be derived from the unsorted list. It seems like, by shifting a few digit pairings around you could get wildly different answers to each unsorted set.

What logic is the name sorting supposed to follow? I've tried all sorts of alphabetical ordering and can't get it to come to the conclusion the problem seems to want.

I wrote almost exaclty the same code, except I had case occelate between 0 and 1

This is a gorgeous single line. Well done.

Oh shit, that makes sense. I'd never considered that it might grab the wrong index before. Thank you.

Can someone explain to my why this has largely been voted best practices? I started learning coding with python, so this looks really verbose to me.