|
|
|
|
|
|
by nostrademons
3713 days ago
|
|
|
I've had to recurse on a tree many, many times, though. Think of filesystems, DOM nodes, parse trees, control-flow graphs, nested annotations, tiered lookups, query builders, JSON structures, etc. That's what this question is actually testing: can you decompose a problem statement, expressed in plain English, into subproblems and then solve the subproblems? |
|
|