Missing number
An array nums contains n distinct integers taken from the range 1..n+1 with exactly one value missing. Given nums, return the missing number. The array has length n (which may be 0, meaning the single number 1 is missing).
Implement
find_missing(nums: list[int]) → intExamples
in
[[1,2,4,5]]out3What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 10 min
solution.py
InputExpectedGot
[[1,2,4,5]]3not run yetsample