python3

javascript

java

Find Center of Star Graph

There is an undirected `star` graph consisting of `n` nodes labeled from `1` to `n`. A star graph is a graph where there is one __center__ node and __exactly__ `n - 1` edges that connect the center node with every other node.

You are given a 2D integer array `edges` where each *edges[i] = [u~i~, v~i~]* indicates that there is an edge between the nodes *u~i~ and v~i~.* Return the center of the given __star graph__ .

### Input Format :
First Parameter: `edges`, *2D array representing graph.*

### Output Format
 Return the center of the given star graph.

### Example 1: 
![img](https://devsnest-custom-images.s3.ap-south-1.amazonaws.com/g1)
```
Input: 
3 2
1 2
2 3
4 2
Output: 
    2
Explanation: 3 2 represents the size of the matrix.
    Node 2 is connected to every other node, so 2 is the center.
```
### Example 2:
![img](https://devsnest-custom-images.s3.ap-south-1.amazonaws.com/g2)
```
Input: 
4 2
1 2
5 1
1 3
1 4
Output: 
    1
Explanation: 4 2 represents the size of the matrix.
    Node 1 is connected to every other node, so 1 is the center.
```
### Constraints:
+ *3 <= n <= 10^5^*.
+ *edges.length == n - 1.*
+ *edges[i].length == 2.*
+ 1 <= u~i~, v~i~ <= n
+ u~i~ != v~i~
+ The given `edges` represent a valid star graph.
+ Expected Time Complexity: O(1)
+ Expected Space Complexity: O(1)


int solve(vector<vector<int>> edges){
//CODE HERE 
}

static int solve(int[][] edges){
//CODE HERE 
}