# Count Ways To Build Rooms In An Ant Colony: Interview Notes

Count Ways To Build Rooms In An Ant Colony shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

The prev-room list forms a tree. Ways equal the product of interleavings of child subtrees: C(size_left + size_right, size_left) down the tree (equivalently n! / product(subtree sizes) times child ways). Mod 1e9+7 with invfacts.

## 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).

## Common mistake

Treating the build order as unconstrained permutations.

## 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 AI interview assistant.