is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.
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.
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.
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.
Using greedy algorithm to solve in O(n) time,
When the array is ascending then descending,
Max will be the one after which the array starts descending
Min will be minimum of first and last values
When the array is descending then ascending,
Min will be the one after which the array starts ascending
Max will be the maximum of first and last values
Please correct me if I am wrong
Following is the code:
- akashcool924 October 01, 2016