Distance to a Cycle in Undirected Graph: coding question

Available question text

Given an undirected graph, return for every vertex the shortest distance to the nearest vertex that lies on any cycle. Key idea: identify cycle vertices by iteratively pruning leaves (nodes not part of any cycle) and then perform a multi-source BFS from remaining cycle nodes to compute distances.

Continue with questions that share topics or the same question type.

Longest Cycle in a Graph
Coding · Breadth-First Search · Depth-First Search · Graph Theory
Alien Dictionary
Coding · Array · Breadth-First Search · Depth-First Search
Course Schedule
Coding · Breadth-First Search · Depth-First Search · Directed Acyclic Graph
Course Schedule II
Coding · Breadth-First Search · Depth-First Search · Graph Theory

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

No company association
Leetcode 2204. Distance to a Cycle in Undirected Graph
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 2 records

Salesforce
Distance to a Cycle in Undirected Graph
Reported date not specified · Source window: 3mo
Source snapshot: Oct 20, 2026
Source frequency score: 72. This is not an interview probability.
View source
Salesforce
Distance to a Cycle in Undirected Graph
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 55.3. This is not an interview probability.
View source

Distance to a Cycle in Undirected Graph

Available question text

Related questions

Distance to a Cycle in Undirected Graph

Available question text

Related questions