1,000+ 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: 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, graph-theory, erdos-renyi, threshold
Consider an Erdős–Rényi random graph $G(n, p)$ where $n$ represents the number of vertices and $p$ represents the probability of an edge existing between any two vertices. You are tasked with determining the sharp threshold for $p$ at which the graph becomes almost surely connected as $n$ approaches infinity. This means you need to find the smallest value of $p$ such that the probability of the graph being connected approaches 1 as $n$ grows large. What is the sharp threshold for $p$ at which th
Practice this hard trader 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.