Google | Software Engineer | Interview Experience
Interview Date: Not specified
Result: Not specified
Difficulty: Not specified
Interview Process
In the first round, I had to solve two coding problems. The interview was conducted via Google Meet. The first question was about finding the longest substring without repeating characters. After explaining my approach and writing the code, I was asked about the time and space complexity of my solution. The second question involved merging two sorted linked lists, where I had to write a function that merged them while maintaining the sorted order. After the coding section, I moved on to the behavioral part, where I was asked about my previous projects, how I handle tight deadlines, and my experience in team settings. Overall, I felt prepared but slightly stressed due to the time constraints.
Technical Questions
- Longest Substring Without Repeating Characters (Hash Table, Two Pointers, String)
- Merge Two Sorted Lists (Linked List)
Tips & Insights
Be prepared to explain your thought process and the complexities of your solutions. Practice coding under time constraints to manage stress during the interview.