More seriously: do people think that any questions that require anything more than DFS, BFS, and/or Dijkstra are reasonable to ask for most general software engineering positions? (I appreciate specific positions might expect more)
Of course, trees are graphs too, and there are loads of tree questions --- I guess I'd narrow my response down to questions regarding general graphs and not just trees.
If I interview with Google again, I’m gonna memorize all graph algorithms I can. All my interviewers asked me graph questions.
Yes and no.
I enjoy making questions that stretch them to see how well they do in situations they have to solve something.
I always preface with "I don't care about the answer, I want to get into your brain" though. I am not sure how many take that to heart.
A slight step up from that could be word search/boggle as it involves multiple data structures (trie, etc).
Another good one is topologically sporting a dependency graph to get a list of dependencies to install/operate on in order.
Follow up: “Which graph would be better at tracking and monitizing our users? Preferably, it would be optimized for lowest memory usage while also not letting our users know how we exploit their trust in us.”
For a take home interview, variations on 8 queens can be interesting since they utilize dfs and backtracking.