@BethanyG, if I use a slightly modified version of your Sublist solution for a sort-lists approach, should I add you in the contributors array for that approach? I'm still not sure how all this authors and contributors array stuff works.

@BethanyG, if I use a slightly modified version of your Sublist solution for a sort-lists approach, should I add you in the contributors array for that approach? I'm still not sure how all this authors and contributors array stuff works.

If that modification has lead to a whole new approach, I'd just put yourself as the author. I am happy being left off. My name is next to so much stuff, no need to invent more. 😄

It's pretty much the same approach, the modifications are more minor. Here's the code:

SUBLIST = 1
SUPERLIST = 2
EQUAL = 3
UNEQUAL = 4

def sublist(list_one, list_two):
    if list_one == list_two:
        return EQUAL
    if not (list_one and list_two):
        return SUPERLIST if list_one else SUBLIST

    shorter, longer = sorted((list_one, list_two), key=len)

    for index in range(len(longer)):
        if longer[index : index + len(shorter)] == shorter:
            return SUPERLIST if longer is list_one else SUBLIST

    return UNEQUAL

still happy being left off. 😄 It's all yours!

Edited to add: Needed a bit of a break, so have been doing some knitting. So I might be a tad slower to answer for a bit. Will get back to things in a bit. 😄

@BethanyG I ended up modifying it a bit more (mostly because I noticed it could be a bit more optimal when the arguments are UNEQUAL). The PR should ready for review now.

Edit: Whoops, there was a copy-paste error I missed. Should be ready for real now.

Uh... Git went a little weird there because I forgot to pull origin before making more changes. Hopefully I didn't break anything?

🤔 I'm feeling a little more confident this time... Maybe it's time to push the big green button!

Smooshed and merged!!