Genuine question, but what is so difficult about reversing a linked list? I don't have the algorithm memorized, but i can deduce in 10 minutes at most.
The issue was that the comp contained a lot of stuff that you couldn't deduce in 10 minutes. For example, all-shortest-paths graph search, performing huge calculations (e.g. stuff that blows up extremely fast), monte carlo simulations and other bits and pieces. It would have made for a much more interesting interview.