Status : SDE (ML)
Relevant YOE : 2
Education : Masters
Google
Position : SWE - ML
Location : Pittsburgh
Referral from a former colleague
Phone Screen 1
Time : 45 minutes
Question 1 : Given an array find which numbers occur fewer than K times in it.
Question 2 : Hand of straights
Phone Screen 2
Time : 45 minutes
Question 1 : Median in a Data Stream
Question 2 : Given an excel spreadsheet and a formula/constant in each cell, find if there is any such cell whose value cannot be computed. For example,
Cell = Content
A1 = B1 + 2
B1 = C1 + 4
C1 = A1 + 6
Essentially, detect a cycle in a graph. Use any method you'd like.
Virtual Onsite
Time : 4 hours ( one 15 minute break )
Interview 1 :
Behavioural - very similar to Amazon's leadership principles
Interview 2 :
Interview 3 :
Given a source string ("abelphata") that was generated using a merge() function and a dictionary object that has only one method called contains() return the original two strings ("alpha" and "beta") that generated the source string.
Constraints:
Interview 4 :
Guess the Word
Modification - the master unlocks the characters and their respective positions which are correct from your guess.
For example, if the target word is "tiger" and you guess "ridge", the master returns "_ i g e r"
Constraints :
Note - Owing to the third constraint some of the leetcode accepted answers such as synthetic guesses, pick a random word, pick the first word etc. aren't acceptable. The interviewer was adamant that there's a better way and it took me 15 minutes to find it and code out.
Interview 5 :
ML and Computer Vision specific questions regarding how I would design classifiers, object detectors etc to be used in random Google products.