Round 0: Resume Shortlisting
Among 400 people, 24 students were shortlisted.

Round 1: Technical (DSA) (Eliminatory)

Q1: Count the number of islands in a binary tree where the nodes have values 0 or 1. An island is a collection of 1's.
Follow-up: Count the unique types of islands that exist in this binary tree according to size.

Verdict: Selected for Round 2

Round 2: Technical (DSA) (Eliminatory)

Q1: In an undirected acyclic graph with a maximum of 3 neighbors per node, find a vertex such that, when suspended from that vertex, the graph becomes a binary tree.
Follow-up:
In an undirected acyclic graph with a maximum of 3 neighbors per node, where each node has a value and a specific color, find a vertex such that, when suspended from that vertex, the graph becomes a binary tree that satisfies the following conditions:

1. All adjacent nodes must be of different colors (Red/Black).
2. All nodes at the same level must be of the same color.

Return -1 if no such node can be found.