Trexquant interview questions

Showing 1–4 of 4 results

• C++ Fundamentals: const Pointers, and map vs unordered_mapMedium

  This question evaluates a candidate's grasp of C++ fundamentals, specifically const-correctness with pointers and the distinction between ordered and hash-based associative containers. It tests conceptual understanding of pointer semantics and data structure trade-offs (tree vs. hash table complexity and ordering), a common check in language-fundamentals interview rounds.

  TrexquantSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• Implement Trie search with wildcard matchingMedium

  This question evaluates understanding of trie data structures, string pattern matching with wildcard characters, and efficient algorithm design for large-scale add/search operations.

  TrexquantSoftware EngineerCoding & AlgorithmsOnsite
• Maintain median of a data streamMedium

  This question evaluates proficiency in streaming data aggregation, dynamic order-statistics maintenance, and algorithmic complexity analysis for insertion and query operations.

  TrexquantSoftware EngineerCoding & AlgorithmsOnsite
• Streaming Median TrackerMedium

  This question evaluates a candidate's ability to design a data structure that maintains a running median over a stream of numbers, testing knowledge of heaps and balanced data partitioning. It is a classic coding and algorithms interview problem used to assess understanding of amortized time complexity and efficient online statistics tracking, requiring practical implementation rather than just conceptual discussion.

  TrexquantSoftware EngineerCoding & AlgorithmsTechnical Screen