Google Developer interview questions

1 phone interview + 1 onsite interview all technical questions even for non-CS candidate contents: data structure, algorithm, system design The onsite interview is tough. Interviewers are polite but some of them are not very friendly... the on-site interview process is high pressure. The key goals in the interviewer is to evaluate your computer science technical ability but nothing else - which means, they basically have no interests in your other strengths. My overall impression is that the interviewers there are less experienced than the interviewers I have met in other companies.

I was asked how to select both the maximal and minimal number from an array of integers. First to write down the recursive algorithm, then the non-recursive. What is the minimal comparisons to find the maximal and minimal? How to prove that number is minimal? What is the best case for your algorithm.