Number of Nodes in the Sub-Tree With the Same Label

Medium
936.

Number of Nodes in the Sub-Tree With the Same Label

Number of Nodes in the Sub-Tree With the Same Label is a medium coding problem on hash table, depth-first search and breadth-first search, asked in Amazon, Google and Salesforce interviews.

A tree of n nodes is rooted at node 0, given by n - 1 undirected edges. labels[i] is the lowercase letter on node i.

Return an array where entry i is the number of nodes in the subtree of node i that carry the same label as node i — including node i itself.

Example 1

Input
n = 7, edges = [[0,1],[0,2],[1,4],[1,5],[2,3],[2,6]], labels = "abaedcd"
Output
[2,1,1,1,1,1,1]
Explanation
Node 0 is labelled `a`, and its subtree holds one more `a` (node 2).

Example 2

Input
n = 4, edges = [[0,1],[1,2],[0,3]], labels = "bbbb"
Output
[4,2,1,1]

Example 3

Input
n = 5, edges = [[0,1],[0,2],[1,3],[0,4]], labels = "aabab"
Output
[3,2,1,1,1]

Constraints

  • 1 <= n <= 10^5
  • edges.length == n - 1
  • edges[i].length == 2
  • 0 <= edges[i][0], edges[i][1] < n
  • labels.length == n
  • labels is made of lowercase English letters.
Write your solution here. Running it against the tests needs a free account — what you type comes with you.Sign in to run
/**
 * @param {number} n
 * @param {number[][]} edges
 * @param {string} labels
 * @return {number[]}
 */
var countSubTrees = function(n, edges, labels) {
    // Write your code here
    
};

Sign in to run your own test cases

Sign in

Number of Nodes in the Sub-Tree With the Same Label Solution

Number of Nodes in the Sub-Tree With the Same Label solution explained: step-by-step approach, complexity and code in Python, Java, C++ and JavaScript.

Number of Nodes in the Sub-Tree With the Same Label is a medium coding problem on hash table, depth-first search and breadth-first search, asked in Amazon, Google and Salesforce interviews.

Problem statement

A tree of n nodes is rooted at node 0, given by n - 1 undirected edges. labels[i] is the lowercase letter on node i.

Return an array where entry i is the number of nodes in the subtree of node i that carry the same label as node i — including node i itself.

Example 1

Input: n = 7, edges = [[0,1],[0,2],[1,4],[1,5],[2,3],[2,6]], labels = "abaedcd"
Output: [2,1,1,1,1,1,1]
Explanation: Node 0 is labelled `a`, and its subtree holds one more `a` (node 2).

Example 2

Input: n = 4, edges = [[0,1],[1,2],[0,3]], labels = "bbbb"
Output: [4,2,1,1]

Example 3

Input: n = 5, edges = [[0,1],[0,2],[1,3],[0,4]], labels = "aabab"
Output: [3,2,1,1,1]

Constraints

  • 1 <= n <= 10^5
  • edges.length == n - 1
  • edges[i].length == 2
  • 0 <= edges[i][0], edges[i][1] < n
  • labels.length == n
  • labels is made of lowercase English letters.

Hints for Number of Nodes in the Sub-Tree With the Same Label

  1. Hint 1

    A node's answer depends only on the letter counts of its subtree.

  2. Hint 2

    There are only 26 letters, so carry a 26-slot tally up the tree.

  3. Hint 3

    Merge each child's tally into its parent's after the child is finished.

How to solve Number of Nodes in the Sub-Tree With the Same Label

Give each node a 26-entry letter tally of its subtree. Process nodes children-first, folding each child's tally into its parent; the answer for a node is its own letter's entry once the fold is complete.

Approach

  1. Root the tree at 0 and record a traversal order with parents.
  2. Seed every node's tally with 1 in its own letter.
  3. Walk the order backwards: read the node's answer, then add its tally into its parent's.
  4. Reading before merging is what keeps a node's tally to its own subtree.

Why it works

The alphabet's fixed size is what makes this linear: a tally is 26 numbers regardless of subtree size, so merging a child costs O(26) rather than O(subtree). Processing in reverse traversal order guarantees a node is read only after every descendant has been folded in, and before it is folded into its own parent.

Complexity

  • Time — O(26 · n)
  • Space — O(26 · n)

Pitfalls

  • Merging a node into its parent before reading its answer mixes in siblings.
  • The tree is given as undirected edges; the root must be fixed at node 0.
  • Recursion can reach depth n; an explicit stack is safer at 100 000 nodes.

Reference solution

Python

from typing import List

def countSubTrees(n: int, edges: List[List[int]], labels: str) -> List[int]:
    adj = [[] for _ in range(n)]
    for u, v in edges:
        adj[u].append(v)
        adj[v].append(u)
    parent = [-1] * n
    order = []
    seen = [False] * n
    seen[0] = True
    stack = [0]
    while stack:
        u = stack.pop()
        order.append(u)
        for v in adj[u]:
            if seen[v]:
                continue
            seen[v] = True
            parent[v] = u
            stack.append(v)
    cnt = [[0] * 26 for _ in range(n)]
    for i in range(n):
        cnt[i][ord(labels[i]) - 97] = 1
    out = [0] * n
    for i in range(len(order) - 1, -1, -1):
        u = order[i]
        out[u] = cnt[u][ord(labels[u]) - 97]
        p = parent[u]
        if p >= 0:
            for c in range(26):
                cnt[p][c] += cnt[u][c]
    return out

Java

public static int[] countSubTrees(int n, int[][] edges, String labels) {
    List<List<Integer>> adj = new ArrayList<>();
    for (int i = 0; i < n; i++) adj.add(new ArrayList<>());
    for (int[] e : edges) {
        adj.get(e[0]).add(e[1]);
        adj.get(e[1]).add(e[0]);
    }
    int[] parent = new int[n];
    Arrays.fill(parent, -1);
    boolean[] seen = new boolean[n];
    int[] order = new int[n];
    int cntOrder = 0;
    int[] stack = new int[n];
    int top = 0;
    stack[top++] = 0;
    seen[0] = true;
    while (top > 0) {
        int u = stack[--top];
        order[cntOrder++] = u;
        for (int v : adj.get(u)) {
            if (seen[v]) continue;
            seen[v] = true;
            parent[v] = u;
            stack[top++] = v;
        }
    }
    int[][] cnt = new int[n][26];
    for (int i = 0; i < n; i++) cnt[i][labels.charAt(i) - 'a'] = 1;
    int[] out = new int[n];
    for (int i = cntOrder - 1; i >= 0; i--) {
        int u = order[i];
        out[u] = cnt[u][labels.charAt(u) - 'a'];
        int p = parent[u];
        if (p >= 0) {
            for (int c = 0; c < 26; c++) cnt[p][c] += cnt[u][c];
        }
    }
    return out;
}

C++

vector<int> countSubTrees(int n, vector<vector<int>>& edges, string labels) {
    vector<vector<int>> adj(n);
    for (auto& e : edges) {
        adj[e[0]].push_back(e[1]);
        adj[e[1]].push_back(e[0]);
    }
    vector<int> parent(n, -1), order;
    vector<char> seen(n, 0);
    vector<int> stack = { 0 };
    seen[0] = 1;
    while (!stack.empty()) {
        int u = stack.back();
        stack.pop_back();
        order.push_back(u);
        for (int v : adj[u]) {
            if (seen[v]) continue;
            seen[v] = 1;
            parent[v] = u;
            stack.push_back(v);
        }
    }
    vector<vector<int>> cnt(n, vector<int>(26, 0));
    for (int i = 0; i < n; i++) cnt[i][labels[i] - 'a'] = 1;
    vector<int> out(n, 0);
    for (int i = (int) order.size() - 1; i >= 0; i--) {
        int u = order[i];
        out[u] = cnt[u][labels[u] - 'a'];
        int p = parent[u];
        if (p >= 0) {
            for (int c = 0; c < 26; c++) cnt[p][c] += cnt[u][c];
        }
    }
    return out;
}

JavaScript

var countSubTrees = function(n, edges, labels) {
    var i, c;
    var adj = [];
    for (i = 0; i < n; i++) adj.push([]);
    for (i = 0; i < edges.length; i++) {
        adj[edges[i][0]].push(edges[i][1]);
        adj[edges[i][1]].push(edges[i][0]);
    }
    var parent = [], seen = [];
    for (i = 0; i < n; i++) { parent.push(-1); seen.push(false); }
    var order = [];
    var stack = [0];
    seen[0] = true;
    while (stack.length > 0) {
        var u = stack.pop();
        order.push(u);
        for (i = 0; i < adj[u].length; i++) {
            var v = adj[u][i];
            if (seen[v]) continue;
            seen[v] = true;
            parent[v] = u;
            stack.push(v);
        }
    }
    var cnt = [];
    for (i = 0; i < n; i++) {
        var row = [];
        for (c = 0; c < 26; c++) row.push(0);
        row[labels.charCodeAt(i) - 97] = 1;
        cnt.push(row);
    }
    var out = [];
    for (i = 0; i < n; i++) out.push(0);
    for (i = order.length - 1; i >= 0; i--) {
        var w = order[i];
        out[w] = cnt[w][labels.charCodeAt(w) - 97];
        var p = parent[w];
        if (p >= 0) {
            for (c = 0; c < 26; c++) cnt[p][c] += cnt[w][c];
        }
    }
    return out;
};

Also on the editorial tab: C, C#, Go, Kotlin, PHP, Ruby, Rust, Swift, TypeScript.

All 439 hash table problems · the whole catalogue

Learn the technique: Hashing: Hash Maps and Hash Sets · Depth-First Search (DFS)