EvenUp Law | Software Engineer (Junior/New Grad) | Coding | Phone Screen
Interview Date:October 7, 2026Region:NA (North America)Hiring Team/Org:Cases
Shortest Path in a Graph — Coding Practice Approximate reconstruction from memory of an EvenUp interview. The original task provided an adjacency list, a start node, and an end node, and asked for the shortest path. The exact examples and assumptions below are chosen for practice. No solution is included. Problem You are given a graph represented as an adjacency list, along with a start node and an end node. Find the...
Sign in to view the full interview experience
Create or use your InterviewDB account to read the full Warren post and all shared details.
Sign in to continue1