Missing number in range
Your task
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].
Examples
missing_number_cyclic(nums: list[int]) -> intExample 1
Input
missing_number_cyclic([3, 0, 1])Output
2