Code RoomMissing number
EasyPrep Room Coding #1601

Missing number

CodingAlgorithms & data structuresEntry–Mid~15 min

An array contains n distinct numbers taken from 0..n. Return the single number that is missing.

Implement
missing_number(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.

0:00 of about 15 min
InputExpectedGot
[[3,0,1]]2not run yetsample