IMC quant engineer interview, one of those sessions that tests whether you actually think or just pattern-match to memorized answers. This question looked like a simple true/false but had a real gotcha buried in it.
“I said true and walked through the math: binary search runs log n iterations, each random access on a linked list costs O(n), so you get O(n log n).” The rest of the author's notes on Software Engineer interview at IMC, Technical Phone Screen round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.