PracHub
QuestionsPremiumLearningGuidesInterview PrepNEWCoaches
|Home/Statistics & Math/Citadel

Solve Classic Probability Questions

Last updated: Apr 20, 2026

Quick Overview

This set evaluates probabilistic reasoning and expectation computation across topics such as sequential conditional survival, convolution of continuous distributions, coupon-collector expectations, variance under uniform sampling in a ball, and constrained online selection decisions, and falls under Statistics & Math with emphasis on probability theory and stochastic processes. These problems are commonly asked to probe analytical probability intuition, facility with integration and combinatorial expectation, handling of information updates and dependence, and formulation of online decision rules; the level of abstraction spans both conceptual understanding and practical application requiring formal probabilistic derivations.

  • hard
  • Citadel
  • Statistics & Math
  • Data Scientist

Solve Classic Probability Questions

Company: Citadel

Role: Data Scientist

Category: Statistics & Math

Difficulty: hard

Interview Round: Onsite

An onsite interview included the following independent probability and expectation questions: 1. **Squid Game bridge problem.** In the classic glass-bridge setup, there are `n` positions to cross. At each position, exactly one of two panels is safe and the other breaks. Players cross sequentially. Once a panel is tested, later players know which panel is safe at that position. If you are the `m`-th player in line, what is your probability of surviving? 2. **Sum of two uniforms.** Let `X, Y ~ Uniform(0,1)` independently. Define `S = X + Y`. What is the PDF of `S`? 3. **Collect all die faces.** You repeatedly roll a fair 6-sided die. What is the expected number of rolls needed to see all 6 faces at least once? 4. **Variance of one coordinate in a 3D unit ball.** A point is sampled uniformly from the **solid** 3D unit ball `B = {(x,y,z): x^2 + y^2 + z^2 <= 1}`. If the sampled point is `(X,Y,Z)`, what is `Var(X)`? 5. **Online selection from uniform draws.** You observe `n` i.i.d. draws from `Uniform(0,1)` one at a time. After seeing each draw, you must irrevocably decide whether to keep it or discard it. By the end, you must keep exactly `k` draws. What is the optimal strategy, and how would you compute the optimal expected total value of the kept draws? (If the interviewer instead asks for expected average value, that is just the expected total divided by `k`.)

Quick Answer: This set evaluates probabilistic reasoning and expectation computation across topics such as sequential conditional survival, convolution of continuous distributions, coupon-collector expectations, variance under uniform sampling in a ball, and constrained online selection decisions, and falls under Statistics & Math with emphasis on probability theory and stochastic processes. These problems are commonly asked to probe analytical probability intuition, facility with integration and combinatorial expectation, handling of information updates and dependence, and formulation of online decision rules; the level of abstraction spans both conceptual understanding and practical application requiring formal probabilistic derivations.

Related Interview Questions

  • Solve probability and stopping questions - Citadel (hard)
  • Find constant minimizing absolute error - Citadel (easy)
  • Solve probability and expectation problems - Citadel (hard)
  • Estimate constant under absolute loss - Citadel (easy)
  • Derive distribution of an inverse transform - Citadel (medium)
Citadel logo
Citadel
Feb 21, 2026, 12:00 AM
Data Scientist
Onsite
Statistics & Math
8
0
Loading...

An onsite interview included the following independent probability and expectation questions:

  1. Squid Game bridge problem. In the classic glass-bridge setup, there are n positions to cross. At each position, exactly one of two panels is safe and the other breaks. Players cross sequentially. Once a panel is tested, later players know which panel is safe at that position. If you are the m -th player in line, what is your probability of surviving?
  2. Sum of two uniforms. Let X, Y ~ Uniform(0,1) independently. Define S = X + Y . What is the PDF of S ?
  3. Collect all die faces. You repeatedly roll a fair 6-sided die. What is the expected number of rolls needed to see all 6 faces at least once?
  4. Variance of one coordinate in a 3D unit ball. A point is sampled uniformly from the solid 3D unit ball B = {(x,y,z): x^2 + y^2 + z^2 <= 1} . If the sampled point is (X,Y,Z) , what is Var(X) ?
  5. Online selection from uniform draws. You observe n i.i.d. draws from Uniform(0,1) one at a time. After seeing each draw, you must irrevocably decide whether to keep it or discard it. By the end, you must keep exactly k draws. What is the optimal strategy, and how would you compute the optimal expected total value of the kept draws? (If the interviewer instead asks for expected average value, that is just the expected total divided by k .)

Solution

Show

Comments (0)

Sign in to leave a comment

Loading comments...

Browse More Questions

More Statistics & Math•More Citadel•More Data Scientist•Citadel Data Scientist•Citadel Statistics & Math•Data Scientist Statistics & Math
PracHub

Master your tech interviews with 7,500+ real questions from top companies.

Product

  • Questions
  • Learning Tracks
  • Interview Guides
  • Resources
  • Premium
  • For Universities
  • Student Access

Browse

  • By Company
  • By Role
  • By Category
  • Topic Hubs
  • SQL Questions
  • Compare Platforms
  • Discord Community

Support

  • support@prachub.com
  • (916) 541-4762

Legal

  • Privacy Policy
  • Terms of Service
  • About Us

© 2026 PracHub. All rights reserved.