← 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: Unknown Level
Round: Phone Screen · Type: Coding · Difficulty: 4/10 · Duration: 60 min · Interviewer: Unfriendly
Topics: Tree Traversal
Location: San Francisco, CA
Interview date: 2026-01-15
The technical phone screen consisted of three N-ary problems.
Question: Part 1: Return the sum of all node values. Part 2: Return the maximum path value. Part 3: Return the node values of the maximum path value.
The coding questions were relatively straightforward. I needed to implement the Node class myself.
My approach: