Google

phone interview B+ tree optimization of database two algorithm problems sort the array so that the odd numbers are in front of the even numbers and their relative order doesn't change in O(n)

I received an email from a recruiter because of my GitHub projects. Following that, I had two technical phone interviews. I passed them, so I had my onsite interview two weeks later. This interview covered strings, dynamic programming, and graphs.

I got my initial phone interview through an employee referral. This was followed up with a second phone interview, as I don't think I did too well on my first one. I did manage to get to an onsite interview in San Bruno with four interviewers. How