How to solve this problem , i could not get an approach for this

#1
#2

Hey @aryan_007
If u have noticed, then constraints are very small,so they are expecting brute force approach .

Enumerate all combinations of nodes (up to 2 ^ 16 combinations), then check if these nodes form a tree. If they do, get the diameter of the tree. Track and return the count of each diameter.