Binary Search for Missing Number | Dataford Interview Questions

How would you find the missing number in an array of length 99 containing unique natural numbers from 1 to 100?

Implement find_missing(nums), where nums contains 99 distinct integers from 1 through 100 with exactly one value absent. Return the missing integer. The solution should run in O(n) time and use O(1) extra space.

Input: a list of 99 integers. Output: the missing integer.

Constraints

nums.length == 99
1 <= nums[i] <= 100
All values in nums are unique
Exactly one integer from 1 through 100 is missing

Function Signature

def find_missing(nums):

Your question is Binary Search for Missing Number. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

How would you find the missing number in an array of length 99 containing unique natural numbers from 1 to 100?

Input: a list of 99 integers. Output: the missing integer.

Constraints

nums.length == 99
1 <= nums[i] <= 100
All values in nums are unique
Exactly one integer from 1 through 100 is missing

Function Signature

def find_missing(nums):

Your question is Binary Search for Missing Number. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.