A collection of all kinds of technical interview questions (programming, algorithm, probability, brainteaser, mathematics, etc.) from various companies
(google, microsoft, yahoo, etc.)
Thursday, October 23, 2008
one dimensional random walk
one dimensional random walk, probability of being at a position >= m after n steps.
[pipizhupi (感受希望) 于 (Thu Mar 1 14:50:18 2007) 发布至 Quant@MITBBS.COM]
No comments:
Post a Comment