very average-to-simple 6 kyu imo. you might just be stuck. (not saying this to be an ass -- just, if it helps, you might be overthinking it and there are simple solutions.)

reference solution sometimes returns No decreasing sequence for the longest increasing subsequence method, and sometimes returns No increasing sequence for the longest decreasing subsequence method.

wow, so clean

The only solution that survived test case generation improvements.

To solve this problem, you need to focus on two key aspects:

1. Extracting the TLD from a URL
2. Sorting by Priority

this is unintelligible.

this is almost my solution no way bruh

what does mean x or '0'?

and there it was. a whole library that fixes the problem in no time, shitting on my algorithm that timed out 10 different times

It'll feel good when you beat it though. :)

this one is an absolute beast. it has kicked me in the pants at least five times now, causing me to scrap refactoring and start fresh again and again. i wish i had to mark this comment as including spoiler content lol. but it's just a note of desperation.

yes. apparently the tests don't catch O(n^2) solutions despite the description.

100%. there are plenty of unoriginal, poorly constructed/described/tested katas on here. this is clearly not one of them. it's a disservice to the community and the authors not to differentiate the good stuff from the bad by voting rationally.

man, this isn't your daddy's 6 kyu kata lol. good one tho.

Should be used as referee as it is the fastest solution.
Or gmpy2 should be forbidden as BigInt is forbidden in Java.