I think that&#x27;s what he meant by &quot;[...] if I had looked at Dijkstra’s shortest path algorithm and breadth-first search one day before my interview, this would have been a trivial problem to solve [...].&quot;.<p>Sure, BFS is &#x27;easy&#x27; but it&#x27;s not really something that stays fresh in your memory after years of not having to use it.<p>I completely agree with his point that it if you have to study for an interview, the process is broken.