What i did in my solution to the problem beautiful vertices is that i maintained parents map as well and then find out the no of chid of every node with its parent.
The given test case is getting passed but the soln is not getting submitted.Please help
Solution not getting submitted
Can a child have more than one parents according to this problem?
@TusHar-AroRa-2294450460870717
The problem is a simple implementation of DFS while maintaining a count of children of the vertices visited. Let u be a vertex and v be its child. Then, check if children[v]>children[u].This way, check for each vertex while traversing the graph in DFS. One important thing to note that actually there are many trees in the input(a graph with no cycles and self-loops is a tree). That means you have to apply DFS for each of these trees.
You can refer to the following code for better understanding:
https://ide.codingblocks.com/s/204947
Hope, this would help.
Give a like if you are satisfied.