Minimum Distance Between Two Nodes

CodeChefOpen on judge ↗

Given an undirected and unweighted graph and two nodes $x$ and $y$, find the length of the shortest path between the two nodes. If no path exists, return $-1$. ## **Function Declaration** ### **Function Name** $getMinimumDistance$ – Finds the minimum number of edges required to travel from one node to another in an undirected graph. ### **Parameters** * $n$ : An integer representing the numb

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI