Round 1: I was asked to solve a problem involving counting words spoken by individuals in a conversation. I used a dictionary for counts and sorted them, but the interviewer asked for a more efficient approach. So, I explained another approach because we didn't have enough time, and he also asked some follow-up questions. For example: [('Person3', 6), ('Person1', 4), ('Person2', 3), ('Person1', 2), ('Person2', 4)]. The input, however, would be in the format of a file with timestamps and other details, for example, "10:45 pm Hi".
Round 2: The interviewer asked a graph problem related to routers and their connectivity. I coded using an adjacency list representation for their wireless connectivity and used DFS to determine if they were connected. This went smoothly, and he also asked some follow-up questions.
Round 3: The interviewer asked me to implement a password cracking system. This person was very annoying; he kept adding constraints and really confused me with some silly questions like, "How do you unlock any door if it is locked? What pattern do you follow to unlock doors?" If I get a "No Hire," it would definitely be from him.
I was asked to solve a problem involving counting words spoken by individuals in a conversation.
The following metrics were computed from 1 interview experience for the Google SWE New Grad role in Montreal, Quebec.
Google's interview process for their SWE New Grad roles in Montreal, Quebec is extremely selective, failing the vast majority of engineers.
Candidates reported having very good feelings for Google's SWE New Grad interview process in Montreal, Quebec.