Puzzle 15 - Non-Recursive List Unpacking(with duplicates)

You’ve been given a jumbled guest list where names are stored in a nested structure of lists within lists. Some guests appear more than once — that’s okay. Your goal is to unpack this structure into a flat list with out using the recurssion and keeping all duplicates . This solution should work with any level of nesting.

Input & Expected Output

Tap For Closer Look

Input List

Guests = ["John Doe","Jane Doe",["Emily Doe","John Doe","Michael Smith"],["sarah Johnson",["Michael Smith","David Brown","Alice Green"],"Bob White","Alice Green"]]

Try solving the question yourself! If you need help, click below to reveal the solution.

def lisunpack2(lst):
    result = []
    list_reverse = lst[::-1]
    while list_reverse:
        item = list_reverse.pop()
        if isinstance(item,list):
            list_reverse.extend(item[::-1])
        else:
            result.append(item)
    return result

unpacked_withoutrecursion = lisunpack2(Guests)

print("##  Input List  #####")
print(Guests)
print("##  OutPut List  #####")
print(unpacked_withoutrecursion)