Count the nodes of a tree whose weighted string is an anagram of the given string

Given a tree, and the weights (in the form of strings) of all the nodes, the task is to count the nodes whose weighted string is an anagram with the given string str.



str = “geek”
Output: 2
Only the weighted strings of the nodes 2 and 6
are anagrams of the given string “geek”.

Approach: Perform dfs on the tree and for every node, check if it’s weighted string is anagram with the given string or not, If not then increment the count.

Below is the implementation of the above approach:





// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
string s;
int cnt = 0;
vector<int> graph[100];
vector<string> weight(100);
// Function that return true if both
// the strings are anagram of each other
bool anagram(string x, string s)
    sort(x.begin(), x.end());
    sort(s.begin(), s.end());
    if (x == s)
        return true;
        return false;
// Function to perform dfs
void dfs(int node, int parent)
    // If current node's weighted
    // string is an anagram of
    // the given string s
    if (anagram(weight[node], s))
        cnt += 1;
    for (int to : graph[node]) {
        if (to == parent)
        dfs(to, node);
// Driver code
int main()
    s = "geek";
    // Weights of the nodes
    weight[1] = "eeggk";
    weight[2] = "geek";
    weight[3] = "gekrt";
    weight[4] = "tree";
    weight[5] = "eetr";
    weight[6] = "egek";
    // Edges of the tree
    dfs(1, 1);
    cout << cnt;
    return 0;




My Personal Notes arrow_drop_up

Data science |Machine learning|Programming facebook -https//wwwfacebookcom/profilephpid=100002787011326

If you like GeeksforGeeks and would like to contribute, you can also write an article using or mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Article Tags :
Practice Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.