Count deps recursive no memoization
Review this JavaScript function used to size a dependency tree.
What a strong answer looks like
Separate real bugs from style. Rank issues by severity, point at the root cause rather than the symptom, and suggest a concrete fix, specific and kind.
0:00 of about 20 min
Mark a line and say what kind of problem it is.0 findings
1function countDeps(node, graph) {
2 if (!graph[node] || graph[node].length === 0) return 1;
3 let total = 1;
4 for (const child of graph[node]) {
5 total += countDeps(child, graph);
6 }
7 return total;
8}
Which questions mattered is sealed until you submit. Telling you now would just be handing over the edge cases.
Run or narrate your approach, then ask the coach.