Missing number in range
An array nums contains n distinct numbers drawn from the range [0, n] (so exactly one number in that range is missing). Return the missing number using O(n) time and O(1) extra space, modifying the input in place is allowed. Constraints: 1 <= n <= 10^4, all nums[i] distinct and in [0, n].
Implement
missing_number_cyclic(nums: list[int]) → intExamples
in
[[3,0,1]]out2What 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 22 min
solution.py
InputExpectedGot
[[3,0,1]]2not run yetsample