# Binary Trees With Factors: Explained
Binary Trees With Factors shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A sorted unique array of numbers that may be used as node values. DP[x] = 1 (a leaf) plus, for every factor a of x that appears in the set with b=x/a also in the set, dp[a]*dp[b]. Sum every dp[x] mod 10^9+7.
## 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^2).
## Common mistake
Forgetting that a*a = x should count dp[a]*dp[a] once, or missing that left/right order a,b and b,a are both allowed when a!=b.
## 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 here.