How would you identify a missing integer in 1-100 in an unsorted array of 99 elements?
Implement find_missing(nums), where nums contains every integer from 1 through 100 exactly once except one missing value. Return the missing integer.
The solution should run in O(n) time and use O(1) extra space.
nums is a list of 99 integers. Return one integer between 1 and 100.
def find_missing(nums):