Count the nodes of a tree whose weighted string does not contain any duplicate characters

Given a tree, and the weights (in the form of strings) of all the nodes, the task is to count the nodes whose weights does not contain any duplicate character.

Examples:

Input:

Output: 2
Only the strings of the node 1 and 4 contains unique strings.

Approach: Perform dfs on the tree and for every node, check if it’s string contains duplicate char or not, If not then increment the count.

Below is the implementation of the above approach:

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
  
int cnt = 0;
  
vector<int> graph[100];
vector<string> weight(100);
  
// Function that returns true if the
// string contains unique characters
bool uniqueChars(string x)
{
    map<char, int> mp;
    int n = x.size();
  
    for (int i = 0; i < n; i++)
        mp[x[i]]++;
    if (mp.size() == x.size())
        return true;
    else
        return false;
}
  
// Function to perform dfs
void dfs(int node, int parent)
{
    // If weighted string of the current
    // node contains unique characters
    if (uniqueChars(weight[node]))
        cnt += 1;
  
    for (int to : graph[node]) {
        if (to == parent)
            continue;
        dfs(to, node);
    }
}
  
// Driver code
int main()
{
  
    // Weights of the nodes
    weight[1] = "abc";
    weight[2] = "aba";
    weight[3] = "bcb";
    weight[4] = "moh";
    weight[5] = "aa";
  
    // Edges of the tree
    graph[1].push_back(2);
    graph[2].push_back(3);
    graph[2].push_back(4);
    graph[1].push_back(5);
  
    dfs(1, 1);
  
    cout << cnt;
  
    return 0;
}

chevron_right


Output:

2


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 contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. 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.