# LeetCode 0268 - Missing Number

## Contents

# Missing Number

## Desicription

Given an array containing n distinct numbers taken from `0, 1, 2, ..., n`

, find the one that is missing from the array.

**Example 1:**

1 | Input: [3,0,1] |

**Example 2:**

1 | Input: [9,6,4,2,3,5,7,0,1] |

**Note:**

Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity?

## Solution

1 | class Solution { |