📘

Missing Number

Given an array containing n distinct numbers from 0, 1, 2, ..., n, find the one that is missing.

Input:

3,0,1

Output:

Reasoning:

The input array is [3, 0, 1], containing n = 3 distinct numbers.
We notice that the array should contain numbers from 0 to n, so the complete set should be [0, 1, 2, 3].
Comparing the input array to the complete set, we find that the number $2$ is missing.
The final output is therefore 2.

Editor

Python 3.13.1

0/0

Run code to see test results.

📘

Given an array containing n distinct numbers from 0, 1, 2, ..., n, find the one that is missing.

Input:

3,0,1

Output:

Reasoning:

The input array is [3, 0, 1], containing n = 3 distinct numbers.
We notice that the array should contain numbers from 0 to n, so the complete set should be [0, 1, 2, 3].
Comparing the input array to the complete set, we find that the number $2$ is missing.
The final output is therefore 2.

Editor

Python 3.13.1

0/0

Run code to see test results.