# https://edabit.com/challenge/mHLAmj4vmRuXrT8Nb
#
# Write a function that returns True if two arrays, when combined, form a consecutive sequence. A consecutive
# sequence is a sequence without any gaps in the integers, e.g. 1, 2, 3, 4, 5 is a consecutive sequence, but 1, 2, 4,
# 5 is not. Examples
#
# consecutive_combo([7, 4, 5, 1], [2, 3, 6]) ➞ True
#
# consecutive_combo([1, 4, 6, 5], [2, 7, 8, 9]) ➞ False
#
# consecutive_combo([1, 4, 5, 6], [2, 3, 7, 8, 10]) ➞ False
#
# consecutive_combo([44, 46], [45]) ➞ True
#
# Notes
#
#     The input lists will have unique values.
#     The input lists can be in any order.


def consecutive_combo(*args: list):
    lists = []
    for arg in args:
        lists = lists + arg
    lists.sort()
    while len(lists) != 1:
        if lists[1] - lists[0] > 1:
            return False
        else:
            del lists[0]
    if len(lists) == 1:
        return True


print(consecutive_combo([7, 4, 5, 1], [2, 3, 6]))
print(consecutive_combo([1, 4, 6, 5], [2, 7, 8, 9]))
print(consecutive_combo([1, 4, 5, 6], [2, 3, 7, 8, 10]))
print(consecutive_combo([44, 46], [45]))
