Find The Missing Number

Write missing_number(values: list[int]) -> int: the list holds every whole number from 1 to n exactly once except one, in any order, where n is one more than the length of the list. Put the values into a set called present, loop over range(1, n + 1) and return the first number that is not in the set; return -1 after the loop if nothing is missing. Do NOT write a main block or any top-level test code; the tests construct the calls. Input: one line of space-separated integers; the tests print the number your function returns.