Give an array with ascending numbers, find the K missing subsquence
for example, given arr = [1,2,3,6,7] k =2 , you should return 5

Got this one in a phone screen, hope it can help some folks out.