Given an array, nums, containing $n$ distinct numbers in the range $[0, n]$, return the only number in the range that is missing from the array.

Constraints:

• $n =$ nums.length
• $1 \leq n \leq 10^3$
• $0 \leq$ nums[i] $\leq n$
• There are no duplicates in the array.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in main.py in the following coding playground. The supporting code template provided in traversal.py is meant to assist in developing your solution to the problem.