Missing Number — Go Coding Problem
Difficulty: easy | Category: array
Problem Description
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. Hint: The expected sum of [0..n] is `n*(n+1)/2`. Subtract the actual sum to find the missing number.
Examples
Example 1
Input: nums = [3, 0, 1]
Output: 2
Explanation: n = 3, range [0,3]. 2 is missing.
Example 2
Input: nums = [0, 1]
Output: 2
Explanation: n = 2, range [0,2]. 2 is missing.
Example 3
Input: nums = [9,6,4,2,3,5,7,0,1]
Output: 8