Google Bangalore Interview Experience
Initial Phone Screen:
The recruiter asked me about my background and discussed the interview procedure. She also asked me some fundamental one-word answer DS/Algo questions like time complexity of quick-sort.
Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!
Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsoft, TCS, Wipro, Google and many more!
Technical Phone Interview 1:
It didn’t go very well as I had trouble explaining my approach to the interviewer. It was a computational geometry question and I had never done questions of this type before. I had a hard time coming up with the naive solution because all the time I kept assuming the solution I was thinking would not work (again lack of confidence). My nervousness was getting bigger as the time kept passing. About 20 minutes later he asked me to code whatever I had yet told him. After I coded, he pointed out cases in which my algo would fail. Since I coded in a very structured and modular way, so I was able to quickly fix it but still, it was not completely correct.
I got my recruiter’s call after a week saying it was a mixed response – she told me that I didn’t think out loud but did very well on all the other parts like data structure and code structuring and they’d like to conduct another phone interview.
Well after the call, I just tried compiling the code and discovered to my astonishment that it ran successfully and the answer was correct. I felt so stupid for not believing in myself all the time, that despite having the ability and enough practice, I was under-confident. Anyway, I was glad that I still had another chance.
Technical Phone Interview 2:
It was an expression evaluation sort of question with some conditions. I did it using stack and finished coding it in 20 minutes. I checked my code twice but missed a syntactical error and he had to point it out. He then asked me a follow-up and I did it in a couple of minutes as I made a function for core logic, so I had to adjust only that. It went superb and in the end, we were left with enough time for chit chat.
As my onsites approached, my LC problem count got 177 – 59 easy, 102 medium, 16 hard
(I started doing hard problems alongside medium ones after I got the onsite invitation as I had to level up my prep. Hard problems are exhausting and are usually a combination of 2-3 medium ones. So I focussed more on medium ones).
Date: January, 2020
As I reached the office, I was very nervous. But I’m happy that my recruiter calmed me and boosted me for the interview.?
The interviewer asked me a warm-up question first and I instantly told her the solution and time/space complexities. That made me feel extremely relaxed. The next question she asked was a graph problem. It could be solved by both dfs/bfs, I discussed why bfs would be a little better over dfs. I wrote down the algorithmic steps before coding and then coding in itself took very little time. (I’ve written this approach in detail in the interview tips below)
The second interviewer asked me to segregate numbers within a range(0 to N) that meet some criteria. I told him the naive iterative approach to check all numbers and then discussed ways to optimize it. I solved it by backtracking to generate only the valid numbers.
Round 3 (Googlyness / Behavioural):
This round felt important in ways that it shows your determination and optimism in different situations. I liked that the questions were scenario-based and open-ended.
It didn’t go as well as my other interview rounds. It was a tree question for which I came up with a recursive solution but wasn’t sure of how to properly make use of the returning values. Time was running out, so he asked me to code whatever I had yet told him. I could not plan my code prior, so had little difficulty implementing it and was re-rewriting my code. By the use of some hints, I could barely finish my code on time. He wasn’t able to ask any follow-ups.
It was an array question for which I came up with a dfs solution but got stuck. The interviewer nudged me towards bfs. I coded the bfs solution and in the follow up he asked me how I would test it.
Result: My onsites went fantastic, so they fast-forwarded my application. The HC approval came next week.
I started my journey by canceling my interview due to my fear of rejection, but now I realise it was me rejecting myself that day! I highly advise everyone – Have faith in yourself and put yourself out there, you may be disappointed if you fail, but you are doomed if you don’t try!
Learning is an uphill journey and it requires a lot of consistent practice. I’m on a full-time job and I saved my break-times to do Geeksforgeeks and leetcode problems. Some days were hectic but I still at least did one problem. I never studied much on my weekends (I wanted to but was too lazy to get out of bed ever). So just stay consistent and soon you’ll start enjoying the process, in fact, you will start finding excuses to do leetcode.
- Clear data structures – I used Geeksforgeeks and HackerEarth tutorials to understand the implementation of various data structures. It was quite explanatory yet brief.
- Clear algos – Spare some time to read CLRS if you wish to be a real programmer. Since it’s very vast, I used it when I needed in-depth knowledge of sorting and dynamic programming.
- Cracking The Coding Interview (by Gayle Laakmann McDowell) – Very very helpful!! Once you have your data structures and algos clear, use this book to learn how to apply the knowledge practically while coding. Start with the first question and keep moving one at a time because difficulty level increases with each question (I felt so).
- Dynamic Programming – For top-down solutions, dfs/backtracking with memorization works well.
- For bottom-up: https://www.byte-by-byte.com/dpbook/ (… though it’s very tough to implement a bottom-up DP in interviews, and no one expects you to do it also)
- Leetcode premium – It is absolutely worth it.
- Mocks – I found both company-wise mocks and random mocks to be helpful in measuring prep. Mocks are good because the problems don’t have the difficulty level tag, so sometimes I could solve hard problems by breaking it down which I would have otherwise ignored knowing it is hard.
- Structure your code better – make functions and reuse.
- Always use a whiteboard if given a choice between whiteboard and pen-paper!! It becomes very easy to explain your solution to the interviewer and it also opens your mind to think in many many directions (due to its vastness).
- If you have difficulty coming up with the naive solution, take a general case example and solve for it. Never take special cases for building solutions, rather keep them as condition covering for later. At this stage, don’t think about the time and space complexities, just solve it because some candidates fail to do even that, so something is better than nothing.
- Discuss time and space trade-offs after each solution you tell, even if the interviewer doesn’t ask you – it is expected to tell yourself.
- Once the solution is discussed and finalised, coding should be as quick as possible. Since it’s not that simple, we can break down the coding steps. (I write algorithmic steps in plain English each time before attempting to code) – like, make a hashmap of the given data – use queue data structure – what arguments to pass to a function – what to return – how to use the return value. This helps in two ways:
- You can easily cover the special cases and edge cases because, at this time, you’re neither thinking about the solution nor coding it, you are just planning how to code it.
- If something is not right, the interviewer can immediately point it out. So it gets fixed before you start coding the wrong solution.
Lastly, big thanks to the GeeksforGeeks for all the inspiring posts and amazing solutions!! All the best to everyone trying out there 🙂