CodingEasycod-g950

Subject ArraysLevel Entry–Mid~10 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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

Examples

in[[1,2,4,5]]out3

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.