Trexquant Interview Questions

Five questions have been reported from Trexquant's Software Engineer loop, and they divide cleanly between data structures you implement and C++ semantics you have to explain out loud. On the implementation side sits a streaming median tracker, asked twice by different candidates, where the expected answer is a max-heap and a min-heap kept balanced so the middle value is available immediately after each insert, plus a trie that supports wildcard search, where a dot in the pattern branches into every child and the recursion has to backtrack. The other two are language questions of the kind quant shops genuinely rely on: when the compiler generates a default constructor and when it quietly declines to, what const binds to on either side of a pointer declaration, and why you would reach for map over unordered_map when ordering or worst-case latency matters more than average lookup cost. Difficulty is flat across the whole set, all five medium, nothing filed easy and nothing filed hard, which suits a bar aimed at fluency rather than at breaking you. This is also one of the few company pages carrying no premium gate anywhere: the three that open a console and the two answered in prose are all readable in full. By round it goes three onsite to two screens.