Missing Number - leetcode 268 - Find Missing Number in an Array

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. Follow up: Could you implement a solution using only O(1) extra space complexity and O(n) runtime complexity? LeetCode Reference: https://leetcode.com/problems/missing-number/ 00:00 - Problem Statement 01:02 - First Approach Using Hashset 02:08 - Second Approach Using Sum of Natural Numbers Formula 03:22 - Third Approach Using XOR Operator 05:04 - Coding Session 05:49 - Test Our Code #MissingNumber #LeetCode268 #FindMissingNumberInArray #LeetCode #Facebook #Amazon #Microsoft #Google