Close
Topic list
Redundant Connection - I
MEDIUM
15 mins
Trees
Graph
Topics (Covered in this problem)
Problem solved
Skill meter
Trees
-
-
Graph
-
-
Other topics
Problem solved
Skill meter
Strings
-
-
Matrices (2D Arrays)
-
-
-
-
Sorting
-
-
Binary Search
-
-
Stacks & Queues
-
-
Dynamic Programming
-
-
Greedy
-
-
Tries
-
-
Arrays
-
-
SQL
-
-
Binary Search Trees
-
-
Heap
-
-
Bit Manipulation
-
-
Solve problems & track your progress
Checkout your overall progress in every topic here
Become
Sensei
in DSA topics
Open the topic and solve more problems associated with it to improve your skills
Check out the skill meter for every topic
See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

# Redundant Connection - I

Contributed by
Dhruv Sharma
Medium
0/80
Avg time to solve 15 mins
Success Rate 85 %
Share

## Problem Statement

#### Example:

`````` Let’s say we have 3 edges that are {1 , 2} , {1 , 3} and {2 , 3}. So
the resulting graph from these edges will be :
1
/ \
2 - 3

If we remove the edge {2, 3} then the resulting graph will be a tree with N nodes.
``````
Detailed explanation ( Input/output format, Notes, Constraints, Images )
##### Sample Input 1:
``````2
3
1 2
1 3
2 3
3
1 2
2 3
1 3
``````
##### Sample Output 1:
``````2 3
1 3
``````
##### Explanation 1:
``````For the first test case,
It is already explained above in the example.

For the second test case,
Let’s say we have 3 edges that are {1 , 2} , {2 , 3} and {1 , 3}. So
the resulting graph from these edges will be :
2
/ \
1 - 3

So here, unlike the previous example If we remove the edge {1, 3} which is the last occurring edge for the graph above only then the would resulting graph become a tree with N nodes.
``````
##### Sample Input 2:
``````2
5
1 2
2 3
3 4
1 4
1 5
4
1 2
1 3
3 4
1 4
``````
##### Sample Output 2:
`````` 1 4
1 4
``````
Auto
Console