An Unweighted Graph Turned Weighted

A friend referred me for a Senior Forward Deploy Engineer role. The interviewer was very nice. The first 30 minutes were a deep dive into my projects, with many questions related to AI. The last 30 minutes were a live coding problem: find the shortest path in an unweighted graph represented by an adjacency matrix. Given the adjacency matrix of a connected, undirected graph with no loops or multip…

Shared by a candidate · reported Aug 2026. Interview formats change; use it as a guide, not a script.