Shortest Distance in an Unweighted Adjacency-Matrix Graph
Company: BCG
Role: Forward Deploy Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Technical Screen
Overview: Find the minimum edge count between two vertices in a connected, undirected graph represented by a Boolean adjacency matrix. The problem tests traversal order, visited-state handling, the same-vertex case, and matrix-specific complexity.
Read the full BCG Forward Deploy Engineer interview experience this question came from