Expected Bins with One Ball - Quant Trader Interview Question
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, expected-value, combinatorics
Problem Description
You are analyzing the performance of a distributed hashing algorithm. The algorithm throws $n$ balls into $n$ bins randomly. Each ball is thrown independently.
What is the expected number of bins that will contain exactly one ball?
Practice this hard trader interview question on MyntBit - the all-in-one quant learning platform with 200+ quant interview questions for Jane Street, Citadel, Two Sigma, and other top quantitative finance firms.