500+ quant interview questions for Jane Street, Citadel, Two Sigma, DE Shaw, and other top quantitative finance firms.
C++ and Python coding challenges for quant developer interviews
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: Easy
Category: Number Theory & Algorithms
Practice quant interview questions from top firms including Jane Street, Citadel, Two Sigma, DE Shaw, and other leading quantitative finance companies.
Topics: data-structures, algorithms, sma, time-complexity
You are building a high-frequency trading system and need to calculate a Simple Moving Average (SMA) of the last $N$ prices efficiently. The system receives a continuous stream of price data and each new price must update the SMA in $O(1)$ time. Which data structure, along with a running sum, allows for an update time complexity of $O(1)$ for each new price update to the SMA?
Practice this easy trader interview question on MyntBit - the all-in-one quant learning platform with 500+ quant interview questions for Jane Street, Citadel, Two Sigma, and other top quantitative finance firms.