Jul 8, 2025
diff --git a/hints/clone-graph.md b/hints/clone-graph.md
 <details class="hint-accordion">
    <summary>Recommended Time & Space Complexity</summary>
    <p>
    You should aim for a solution with <code>O(V + E)</code> time and <code>O(E)</code> space, where <code>V</code> is the number of vertices and <code>E</code> is the number of edges in the given graph.
    You should aim for a solution with <code>O(V + E)</code> time and <code>O(V)</code> space, where <code>V</code> is the number of vertices and <code>E</code> is the number of edges in the given graph.
    </p>
 </details>

    <p>
    We stop this recursive path when we encounter a node that has already been cloned or visited. This DFS approach creates an exact clone of the given graph, and we return the clone of the given node.
    </p>
 </details>
 </details>
Original file line number	Diff line number	Diff line change
Expand Up		@@ -2,7 +2,7 @@
		<details class="hint-accordion">
		<summary>Recommended Time & Space Complexity</summary>
		<p>
		You should aim for a solution with <code>O(V + E)</code> time and <code>O(E)</code> space, where <code>V</code> is the number of vertices and <code>E</code> is the number of edges in the given graph.
		You should aim for a solution with <code>O(V + E)</code> time and <code>O(V)</code> space, where <code>V</code> is the number of vertices and <code>E</code> is the number of edges in the given graph.
		</p>
		</details>

Expand All		@@ -28,4 +28,4 @@
		<p>
		We stop this recursive path when we encounter a node that has already been cloned or visited. This DFS approach creates an exact clone of the given graph, and we return the clone of the given node.
		</p>
		</details>
		</details>