Compute graph distance and impacted services

Read the full interview experience this question came from →

Quick Overview

This question evaluates proficiency in graph algorithms and traversal (shortest-path/BFS and cycle handling), file-path/tree modeling, dependency graph reasoning, and ordering impacts across service producers and consumers.

Compute graph distance and impacted services

Company: LinkedIn

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Overview: This question evaluates proficiency in graph algorithms and traversal (shortest-path/BFS and cycle handling), file-path/tree modeling, dependency graph reasoning, and ordering impacts across service producers and consumers.

Read the full LinkedIn Software Engineer interview experience this question came from

LinkedIn logo
LinkedIn
Dec 26, 2025
mediumSoftware EngineerOnsiteCoding & Algorithms
22
0
Loading...