Round 1
Questions:
- Question 1: Find the node in a graph that could act as the root of a tree. This problem tested my understanding of graph traversal techniques.
- Question 2: Determine if the levels of a tree were alternately colored. This required logic and a clear grasp of tree properties.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2
Questions:
- Question: Given match outcomes between n players, determine if it’s possible to rank all players precisely. This graph theory problem revolved around dependencies and ordering.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3
Questions:
- Question: Allocate rooms to interns in an apartment based on their preferences to maximize the number of satisfied interns. This required solving a combinatorial optimization problem.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 4
Questions:
- Question: Given a rectangular PCB board with n components, find the maximum number of components that can be touched by a single straight line (horizontal or vertical). This required analytical and geometric reasoning.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.