Question

Given a sorted array of n distinct integers where each integer is in the range from 0 to m-1 and m > n. Find the smallest number that is missing from the array. Examples input: {0, 1, 2, 6, 9}, n = 5, m = 10 output: 3 input: {4, 5, 10, 11}, n = 4, m = 12 output: 0 input: {0, 1, 2, 3}, n = 4, m = 5 output: 4 input: {0, 1, 2, 3, 4, 5, 6, 7, 10}, n = 9, m = 11 output: 8 test case 1 input (stdin) 9 0 1 2 3 4 5 6 7 10 expected output 8

Answer 1

Answer:

fydy jd r hd Ht s DVD jy shshdeus

Explanation:

tsfkdhsjwgwahauawyahacauhfsshayahjwhswhebe bg shshdsghfsucevsjtrfhdyhgdcuf