182. Redundant Connection

Medium

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: edges = [[1,2],[1,3],[2,3]]

Output: [2,3]

Explanation: Nodes 1 and 2 are connected. Nodes 1 and 3 are connected. When processing [2,3], nodes 2 and 3 are already connected via node 1 (2-1-3), so adding [2,3] creates a cycle. This is the last edge in the input that closes a cycle.

Example 2:

Input: edges = [[1,2],[2,3],[3,4],[1,4],[1,5]]

Output: [1,4]

Explanation: Initially, 1-2, 2-3, 3-4 are processed, connecting 1,2,3,4 into one component. When processing [1,4], nodes 1 and 4 are already connected (1-2-3-4). Thus, [1,4] is the redundant edge that forms a cycle. [1,5] is then processed, connecting node 5, but the cycle was already formed by [1,4].

Constraints:

•
•
•
•
•
•
•

Time Complexity

O(N * α(N))

Space Complexity

O(N)

182. Redundant Connection

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

182. Redundant Connection

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Constraints:

Learn

Topics

Companies

Hint

Use Cases