Find in Ordered Set (Practice Interview Question)

Suppose we had an array of n integers sorted in ascending order. How quickly could we check if a given integer is in the array?

Because the array is sorted, we can use binary search to find the item in time and additional space.

Wanna review this one again later? Or do you feel like you got it all?

Mark as done Pin for review later