google logo
Google· SDE 3

Google | Bengaluru | SDE 3 | Reject

Result
Rejected
Location
Bengaluru
Experience
3.5 years
Posted
12 May 2025
507 reads

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.

How it went

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.

Questions asked (6)

  1. 01

    Coin Toss Jump to N

    Data Structures & Algorithms

    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.

  2. 02

    Necklace Division with Diamonds and Rubies

    Data Structures & Algorithms

    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.

  3. 03

    Secure Singly Linked List Implementation

    Data Structures & Algorithms

    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.

  4. 04

    Manager's Unreasonable Demands & Product Release

    Behavioral

    Describe a situation where your manager had unreasonable demands. How did the product release go through? What were the learnings?

  5. 05

    Project with Business Impact

    Behavioral

    Describe a project where you had a lot of business impact?

  6. 06

    Minimum Teleportations in Defective Space Stations

    Data Structures & Algorithms

    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.

How they prepared

I leveraged the resources and insights provided by this community during my preparation, which proved beneficial in navigating the interview process.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Google recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!