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: Probability & Statistics
Practice quant interview questions from top firms including Jane Street, Citadel, Two Sigma, DE Shaw, and other leading quantitative finance companies.
Topics: probability, geometric-distribution, memoryless, conditional-probability
Let $X$ be a geometric random variable representing the number of trials until the first success, with success probability $p$ on each trial. The geometric distribution is memoryless. This means that knowing you've already had $m$ failures doesn't change the probability of needing $n$ more trials. Express $P(X > m+n | X > m)$ in terms of $n$. Remember that $P(A|B) = \frac{P(A \cap B)}{P(B)}$.
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.