Available question text
Find the graph's girth: given an undirected simple graph, return the length (number of edges) of the shortest cycle or -1 if none exists. With n,m ≤ 1000, this is typically solved by repeated BFS/shortest-path searches on the unweighted graph to detect the minimal closed loop.
Related questions
Continue with questions that share topics or the same question type.
- Design Graph With Shortest Path Calculator
Coding
- Distance to a Cycle in Undirected Graph
Coding · Breadth-First Search · Depth-First Search · Graph Theory
- Longest Cycle in a Graph
Coding · Breadth-First Search · Depth-First Search · Graph Theory
- Shortest Path Between Two Nodes in a Graph
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Microsoft
Leetcode 2608. Shortest Cycle in a Graph
Reported Aug 1, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source