← Back to experiences
[ OK ] Loaded —
[ INFO ]
$ cd
$ ls -lt
01
02
03
04
05
$ ls -lt
01
02
03
04
05
user@intervues:~/experiences/…$
Level: Intern
Round: Virtual Onsite · Type: Coding · Difficulty: 6/10 · Duration: 60 min · Interviewer: Unfriendly
Topics: Graph Theory, Data Structures
Location: Mountain View, CA
Interview date: 2025-12-01
Question: Determine if two chickens have a blood relationship given parent-child relationships.
The interviewer was a senior engineer with over ten years of experience. The question was well-designed and required me to clarify the requirements and choose appropriate data structures. The algorithm itself was not difficult.
The coding question I got was:
python def are_related(chicken1, chicken2, parent_child_relationships): # Implementation to determine if chicken1 and chicken2 are related pass