Google | Bengaluru | SDE 3 | Reject
Summary
I interviewed for an SDE 3 position at Google in Bengaluru, sharing detailed questions from multiple rounds. Despite my efforts, I was ultimately rejected due to negative feedback on one of the technical rounds.
Full Experience
Hi folks, I have around 3.5 years of experience. I gave my Google interviews in March. This community helped me immensely, and now I'm sharing my experience and the questions I was asked to give back.
Round 1 - Screening - DP
This round focused on Dynamic Programming.
Round 2 - Sliding Window
This was another technical round.
Round 3 - Linked List
This round involved implementing a secure linked list.
Round 4 - Googleyness
This round focused on behavioral aspects and my past experiences.
Round 5 - Graph BFS
The final technical round involved a graph problem using BFS.
Verdict
I received negative feedback for Round 2, indicating that I took hints during the problem-solving process. Consequently, I was rejected.
Interview Questions (6)
There are N + 1 squares in a linear fashion labeled 0 to N. A player starts from square 0. He has 'm' coins. He tosses all of them before proceeding. If all are heads, he jumps 2 steps or else he jumps 1 step. Find the number of different scenarios where the player can reach the last square.
There is necklace with 2xD diamonds and 2xR rubies. You need to cut the necklace 2 or fewer times to divide it among two people in such a way that both will have same number of diamonds and same number of rubies.
Implement a secure singly linked list. Each node should have a hash value which is computed based on the current node's data and the next node's hash value. Implement prepend, insert at given index and validate functionalities. Also given an array, convert it to a secure linked list.
Describe a situation where your manager had unreasonable demands. How did the product release go through? What were the learnings?
Describe a project where you had a lot of business impact?
Given a set of space stations, one can teleport from one space station to another instantaneously. There are some space station which are defective and you will get lost if you reach that station. Find the minimum number of teleportations required to move from one space station to another.
Preparation Tips
I leveraged the resources and insights provided by this community during my preparation, which proved beneficial in navigating the interview process.