even logo
Even· SWE Intern

Even Round 2 Interview Experience (SWE Intern - Jul to Dec '25)

Posted
8 Jun 2025
273 reads

Summary

I experienced Even's Round 2 technical interview, which focused on a series of tree-based distance and latency problems, gradually leading to a well-known LeetCode hard problem.

How it went

🧪 Even Round 2 Interview – Tree Distance and Latency Questions

In Even Round 2 technical interview, I was asked a series of tree-based distance and latency problems that built upon each other. The questions started with a basic BFS and gradually led to a well-known LeetCode hard problem.


Given:

A tree with n nodes labeled from 0 to n-1 and an undirected list of edges, with unit distance between each node:

Example:

n = 6  
edges = [[0,1], [0,2], [2,3], [2,4], [2,5]]

Questions asked (3)

  1. 01

    Latency from Source Node

    Data Structures & Algorithms

    Define latency as the sum of distances from a node to all others. Find the latency from the given src node.

  2. 02

    Latency from a Random Node

    Data Structures & Algorithms

    Compute the latency for any node input.

  3. 03

    Sum of Distances in Tree

    Data Structures & Algorithms · Hard

    Return an array result such that: res[i] = sum of distances from node i to all other nodes.

    Open the problem

How they prepared

💬 Interview Tip

These questions test your ability to:

  1. Traverse trees (BFS/DFS)
  2. Accumulate values across traversals
  3. Optimize naive solutions using recursive insights

Be prepared to build on each solution — the interviewer will often move from BFS → brute-force → optimized tree DP.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Even recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!