Get a free weekly practice problem!

Keep that axe sharp.

× No thanks

You only have free questions left (including this one).

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 a list of n integers sorted in ascending order. How quickly could we check if a given integer is in the list?

Start your free trial!

Log in or sign up with one click to get immediate access to free mock interview questions

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

Mark as done Pin for review later

Reset editor

Powered by

. . .