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.
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:
- Count the nodes of the given tree whose weighted string is a palindrome
- Count the nodes of the tree whose weighted string contains a vowel
- Count the nodes of a tree whose weighted string is an anagram of the given string
- Find maximum count of duplicate nodes in a Binary Search Tree
- Weighted sum of the characters of a string in an array | Set 2
- Minimum distance to visit all the nodes of an undirected weighted tree
- Lexicographic rank of a string with duplicate characters
- Count the nodes of the tree which make a pangram when concatenated with the sub-tree nodes
- Count of times second string can be formed from the characters of first string
- Count the nodes in the given tree whose weight is even
- Count the nodes in the given tree whose weight is prime
- Count the nodes in the given tree whose weight is even parity
- Count the nodes in the given tree whose sum of digits of weight is odd
- Count the nodes in the given tree whose weight is a power of two
- Count the number of nodes at a given level in a tree using DFS
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.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.