Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > The Shortest Loop > Editorial

The Shortest Loop — Solution & Editorial

Back to the Problem

BFS from every vertex; when BFS meets a node from two different parents, a cycle of length dist[u]+dist[v]+1 closes. The minimum over all sources is the girth.

Complexity: O(N(N + M))

Watch out: Skip the BFS parent edge, but a cross edge to an already-visited node at the same or next layer closes the cycle.