Google

Given a sorted array of n integers that has been rotated an unknown number of times, write code to find an element in the array. Design an algorithm and write code to find the first common ancestor of two nodes in a binary tree. Avoid storing additi

From a phone screen, I then went onsite. HR gave good feedback but said there was no offer. They transferred me to another program, and then I had two more phone screens. I failed on a simple problem.

The first step is an easy coding interview. The second round is a call with a developer who will quiz you and watch as you code. Speak out loud during this process, as your thought process is key. The final round is an in-person interview. Four sep