# Count Valid Paths In A Tree: Explained

Count Valid Paths In A Tree shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A path is valid if it contains exactly one prime-labeled node. Sieve primes, split the tree at primes, and for each prime look at neighboring composite components: paths through that unique prime are combinations of those component sizes (plus the prime alone).

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n log log n).

## Common mistake

Counting paths with any number of primes, or treating composites as the split points.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at Linkjob.ai.