Can anyone please help me in one problem?
Problem: You are given a an undirected connected graph, and Q queries, in each query you will be given a vertex 'v' and output for each query should be largest connected component size after removal of vertex 'v'.
number of nodes <= 10^5
queries <= 10^5
Note: Queries are independent.