I specifically looked into how difficult Jeff's achievements are. First, the people recruited by HRT are "the best among geniuses," and the difficulty of their interview questions is such that most computer science undergraduates from prestigious universities can hardly pass, while those who have won ACM gold medals might have a chance to succeed…
Here are some problems for everyone to study:
- There is a coin with a probability of heads p. Continuously flip the coin until heads appears for the first time, and let the number of flips be the random variable N.
Prove that E[N] = 1/p.
If the payoff for each flip is 2^(k-1) (the profit from the k-th flip), find the expected profit.
There are 21 matches on a table, and two people take turns picking matches, with each able to take either 1 or 2 matches. The person who takes the last match wins. As the first player, how can you ensure a win?
An infinite data stream continuously inputs integers. Please output the current top-k elements that appear most frequently in real-time. Requirements:
Limited memory, cannot store all data.
The stream speed is very fast, and the latency must be low.
k can vary.
免责声明：本文章仅代表作者个人观点，不代表本平台的立场和观点。本文章仅供信息分享，不构成对任何人的任何投资建议。用户与作者之间的任何争议，与本平台无关。如网页中刊载的文章或图片涉及侵权，请提供相关的权利证明和身份证明发送邮件到support@aicoin.com，本平台相关工作人员将会进行核查。
