Joshi Quant Interviews Selected Problems
Table of Contents
The red book Quant Job Interview Questions and Answers is an excellent book signatured by its completeness and the follow-up questions after each solution. Since the primary author named Mark Joshi, for easiness, I will call it Joshi Book.
| Chapter | Comments |
|---|---|
| Option Pricing | |
| Probability | Omit 32, 34-38 |
| Interest Rates | |
| Numerical and Algo | |
| Math | |
| Coding C++ | |
| Brainteasers |
Chapter 3 Probability
1-100 Number Game
The payer tends to choose a small number because he pays less. But if the player knows this, then the likelihood to pay is also increasing. This is a game theory problem.
Translate this to math, for the picked number $k$, we want the payoff and the likelihood be reciprocal to reflect the above principle. Then the probability that among $1-100$, that number $k$ is selected is
And the expected payoff is natural to be $\left(\sum_{j=1}^{100} \frac{1}{j}\right)^{-1}$.
Dart Game
Even the hitting chance increases to $2/3$, this is still a bad choice.
Kth Order Statistic
Convolution Z=X+Y and Z=XY
Chapter 8 Brainteasers
Snow Clearing Car
Suppose the snow has began $x$ hours before midday. The speed of the snow car is function of $t$, and denote it as $s(t)=\frac{\alpha}{t}$. Denote the distance covered during a period of time as $d(t_1, t_2)$, then as indicated by the question, we can write down,
Solving the $x$, we have $x=\frac{1}{2}(-1 \pm \sqrt{5})$. Only the positive answer is kept.
Balance Integers
Subset of Integers
Brown and Blue Eyes
- If there is only one blue-eye person. Then he will commit suicide at 1st day as he knows everyone else has brown eye.
- If there are two blue-eye person, both of them know the other person with blue eye, but they are not sure about themselves. However, they know if the other person is logical enough, and he is the only one of blue-eye, he will commit suicide as indicated by 1. The next day, if they find nothing happened last night, then they know they two are the blue-eye people, they will commit suicides together at 2nd night.
- Same story for $n$ people.
- The result is that, if there exists $n$ blue-eye people, they will commit suicide at the same time on the $n-th$ night.
NIM
There are various versions of the game of NIM but let’s consider a simple one. There are $n$ matches, for example 10 , on the table. Each turn you can take 1,2 or 3 matches. The person who takes the last stick loses.
Think backward. We want to leave exactly 1 stick for the opponent, which can be made if we leave him with 5 sticks. No matter how he picks, we can leave 1 stick for him to lose. Then the next position is to leave 9 sticks. Overall, if we left $4j+1$ sticks to our opponent, then we are guaranteed to win.