Challenge: Count the number of Edges in an Undirected Graph
Try to solve the Count the Number of Edges in an Undirected Graph problem.
We'll cover the following
Statement
Given an n
number of nodes in an undirected graph, compute the total number of edges.
Constraints:
n
edges.length
edges[i].length
n
There are no multiple edges between any two vertices
There are no self-loops
Examples
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.