Hello every one ,wish you are doing great .... can any one explain how does this code doesn't got TLE ? https://mirror.codeforces.com/contest/246/submission/79394388

the nodes that are in distance k from node v are in depth = depth[v] + k let it d and using euler tour we can get the nodes which are in the subtree of v and also in depth d and to get the number of distinct strings I just made a set of strings and iterate over all nodes in the range and save it

thanks in advance