3 ms·
And I'm sure he would have accepted that in a discussion about the complexity.
by throwawaylinux 3y ago
And I'm sure he would have accepted that in a discussion about the complexity.
- fenomas 3y agoThe underlying issue here is that TFA doesn't describe having a discussion about the complexity. If the author asked about complexity as an open-ended question with no fixed answer, that would be a very reasonable way to hear how the candidate thinks about algorithms. But TFA makes it clear that the author treats it as a gotcha question - he expects candidates to say o(n) and then pushes them to give the answer he wants. That's not a great approach, even if the interviewer's preferred answer is unambiguously correct - and here it's not.
- throwawaylinux 3y agoI don't think that's the underlying issue. TFA sounded quite open about getting into deeper discussions and side topics as they go.