Apparently it does >:(

I'm guessing it's because it's strictly following the principle of single responsibility. Every function does exactly one thing. But idk, doesn't look great to me.

You're right, this is a bloated solution. Some people seem impressed by this kind of thing.

donio95, because soriting takes O(n*log(n)) time, finding the minimum takes O(n) time.

sekulski, why is it have greater computational complexity than list of lens?

I think you're right, it only seems to works in Python 3.6.0.

Keep trying!

that is where i am stuck as well :)

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.

That's why it's 5 kyu, because the slicing is part of the a problem. Although it's not that difficult as it seems at first :-)

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.

Marking as resolved.

read the comments below.