Google | Software Engineer | Interview Experience
Interview Date: Not specified
Result: Not specified
Difficulty: Not specified
Interview Process
The interview process was structured into two parts: a coding challenge followed by behavioral questions. In the coding round, I was given two problems to solve on a shared screen. The first problem involved implementing a function to reverse a linked list and return the new head node. The second problem was about finding the intersection of two linked lists, where I had to determine if they intersect at some point and return the intersecting node.
After completing the coding portion, I transitioned to the behavioral interview segment, where the interviewer asked about my past experiences and how I approach problem-solving. Questions included scenarios dealing with conflict resolution in a team and how I prioritize tasks in a deadline-driven environment.
Technical Questions
- Reverse Linked List (Linked List, Recursion)
- Intersection of Two Linked Lists (Linked List, Two Pointers)
Tips & Insights
Be prepared to explain your thought process during the coding challenges and provide examples from your past experiences during the behavioral interviews.