Giters

riddhi-jain / DSAready

This is a beginner-friendly project aiming to build a problem-set on different data structures and algorithms in different programming languages.

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Missing Number

riddhi-jain opened this issue · comments

commented

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?

Example :

Input: nums = [3,0,1]
Output: 2
Explanation: n = 3 since there are 3 numbers, so all numbers are in the range [0,3]. 2 is the missing number in the range since it does not appear in nums.

P.S. This problem belongs to Sorting and Searching category, so raise your PR accordingly.