500+ quant interview questions for Jane Street, Citadel, Two Sigma, DE Shaw, and other top quantitative finance firms.
Statistical analysis and quantitative modeling problems
Trading MCQs, probability brainteasers, and market scenarios
Practice quant interview questions on MyntBit - the all-in-one quant learning platform. Free questions available for C++ coding, Python problems, probability brainteasers, and trading MCQs.
Difficulty: Hard
Category: low_latency
Practice quant interview questions from top firms including Jane Street, Citadel, Two Sigma, DE Shaw, and other leading quantitative finance companies.
Topics: branchless, cmov, order-routing, low_latency, tournament, argmin
In high-frequency trading, order routing systems must select the best execution venue in nanoseconds. Standard if/else logic causes CPU branch misprediction penalties, but a branchless argmin implemented with ternary operators avoids this by compiling to CMOV (conditional move) instructions. This technique, structured as a tournament, finds the minimum-priced venue in constant, predictable time. Task Implement the function branchless_route(const double venues) to return the int index (0-3) of t
Practice this hard developer interview question on Myntbit - the all-in-one quant learning platform with 1000+ quant interview questions for Jane Street, Citadel, Two Sigma, and other top quantitative finance firms.