3 technical interviews + 1 hr.

I passed the first interview, then they canceled the other interviews and invited me to another interview, which didn't go well.

The interviews are 1 hr, which is not enough for getting to know each other and asking technical questions.

A local max in an array is an element that is larger than both of its neighbors. (End points are a special case.)

Example array: [11, 2, 4, 7, 34, 22, 50]

• 11 is a local max because 11 > 2
• 50 is a local max because 50 > 22
• 34 is a local max because 34 > 7 and 34 > 22

Find an algorithm that returns any local max in a unique array in O(log n) time complexity.