Interview Question

Country: United States
Interview Type: Phone Interview

Comment hidden because of low score. Click to expand.
of 0 vote


Left Pivot Point : which satisfies the condition that all values to its left are less than it.

Right Pivot Point: which satisfies the condition that all values to its right are greater than it.

What we are looking for is a point which is both a left pivot and a right pivot.

Here is an O(N) time, O(N) space algorithm to determine for each point of the array, whether it is a left pivot.

Walk the array from left to right, maintaining the max seen so far.
If the current element you see is >= max, then it is a left pivot (and update a boolean array).
Update max, and continue.

Similary do for right pivot, and then find the common elements.

- Subbu. November 19, 2013 | Flag Reply

Add a Comment

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.


is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More


CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More