Google SWE - II Phone screening round
Anonymous User
1233

📞 Phone Screening Interview Summary
🗓 Date: April 9th, 2025
🧑‍💼 Interviewer: A calm and friendly individual
⏱ Duration: ~5 minutes for introductions, followed by technical questions

✅ Technical Questions
Q1: Count the Number of Islands in a Binary Tree
Problem Statement:
Given a binary tree where each node contains either 0 or 1, return the number of islands.

Definition of an Island:

A group of adjacent 1s (connected vertically or horizontally, like in a graph traversal).

Surrounded by 0s or ends at a leaf node.

Q2: Count the Number of Distinct Size Islands
Problem Statement:
Return the number of distinct sizes of islands identified in the binary tree.

Explanation:

For each island found in Q1, calculate its size (i.e., number of 1s in that connected group).

Store each island size in a set to determine how many unique sizes exist.

I was able to come up with 1st solution,
but as only 5 mins was left I just gave a basic approach to the interviewer which was not also correct.

After 1 day I got the rejection.
Great learning though !!

Comments (6)