Get a free weekly practice problem!

Keep that axe sharp.

× No thanks

You only have free questions left.

But it doesn't have to end here! Sign up for the 7-day coding interview crash course and you'll get a free Interview Cake problem every week.

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?

You must log in with one click to view the rest.

Once you're logged in, you'll get free full access to this and 4 other questions.

What's next?

Powered by

. . .