A lot of advice I've read about interviewing suggests that a candidate should leave answers open and provide room for the interviewer to poll for more info. I'm curious to know if the author goes out of their way to poll about the specifics of the hash table implementation?
In fact, one of my favorite interviews in recent memory was a hash table discussion not unlike the one the author is hoping for. I was happy to find an interviewer whose questions balanced theory with practice and was happy to drive to a solution with them. However, I wouldn't have offered up this analysis without first understanding that this is where the interviewer wanted to drive the discussion. Every good programmer knows that premature optimization is the devil.
The author may instead be trying to raise the point that its up to the discretion of the interviewee to see that the hash table implementation is the critical performance detail. e.g. gotta do open addressing here b/c our hashing function has weird edge cases where it collides all the time and chained hash would bring us closer towards a log(n) traversal on that edge case.
However, in my limited interviewing experience, interview problems such as this are often designed to be open-ended conversation rollers moreso than where implementation specifics like this are able to jump out easily.