Graph Construction and Math | Dataford Interview Questions

Given N(total nodes) and two arrays consisting the edges, for each acyclic graph, add nodes in graph, calculate the square root and add all square roots.

Asked in the HackerRank OA stage. Treat nodes as labeled 1 through N; edge_u[i] and edge_v[i] form one undirected edge. The edges form a forest. Return the sum of the square roots of the node-label totals for all connected components.

Input and Output

Implement sum_component_square_roots(n, edge_u, edge_v). Return a floating-point value. Nodes with no incident edge form single-node components.

Constraints

1 <= n <= 10^5
0 <= len(edge_u) = len(edge_v) <= n - 1
Every endpoint is in [1, n]
The undirected graph is acyclic

Function Signature

def sum_component_square_roots(n, edge_u, edge_v):

Your question is Graph Construction and Math. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem