CodingMediumcod-g326

Subject SortingLevel Mid–Senior~22 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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]) → int

Examples

in[[3,0,1]]out2

What 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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.