Google Technical Interview

google logo
google
Rejected
September 6, 20240 reads

Summary

I interviewed with Google for a technical role on September 2nd. The 45-minute session involved two challenging binary tree problems. Although I was not selected for the next rounds, the experience was a valuable learning opportunity that significantly boosted my confidence.

Full Experience

On September 2nd, I had the opportunity to interview with Google. The interview was a 45-minute one-on-one session, starting with introductions from both the interviewer and myself, which set a positive tone.

The technical part of the interview started with a problem involving binary trees. The first task was to design a tree where the parent node dictated the left and right child nodes' positioning based on specific conditions. I outlined the tree structure and then moved on to the next challenge: checking if a given number was present in the tree, assuming it was infinitely constructed.

While I knew the general approach for both problems, I missed a few critical points during the discussion. Despite this, the interviewer was supportive, and I took it as a valuable learning opportunity.

Unfortunately, I was not selected for the next rounds, but the experience taught me a lot in a short amount of time. It was incredible exposure to complex problem-solving in a high-stakes environment.

I am grateful to Google for this opportunity, as it significantly boosted my confidence and inspired me to keep improving. This experience has motivated me to work harder and prepare better for future challenges. Thank you, Google, for providing this platform, and I look forward to future opportunities to continue growing and learning.

Interview Questions (2)

Q1
Binary Tree Design with Conditional Child Positioning
Data Structures & Algorithms

Design a binary tree where the parent node dictates the left and right child nodes' positioning based on specific conditions. I was asked to outline the tree structure.

Q2
Search in Infinitely Constructed Binary Tree
Data Structures & Algorithms

Check if a given number is present in a binary tree, assuming the tree is infinitely constructed.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

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