|
1 | 1 | # Quantitative interview questions and strategies
|
2 | 2 |
|
3 |
| -Table of content |
| 3 | +## Table of content |
4 | 4 | ---
|
5 |
| -<TBA> |
| 5 | + |
| 6 | + |
| 7 | + |
| 8 | +--- |
| 9 | + |
| 10 | +## Introduction: objective and scope |
| 11 | + |
| 12 | +Pertinent, concise, intuitive, self-contained. |
| 13 | + |
| 14 | + |
6 | 15 |
|
7 |
| -# Calculus and linear algebra |
8 |
| -# Probability |
9 |
| -# Statistics |
10 |
| -# Programming essentials |
11 |
| -# Numerical methods and optimization |
12 |
| -# Machine learning concepts |
| 16 | +## Calculus and linear algebra |
13 | 17 |
|
14 | 18 |
|
15 | 19 |
|
16 |
| -# Probability |
17 |
| -## Combinatorics |
| 20 | +## Probability |
| 21 | +### Combinatorics |
18 | 22 | - Permutation
|
19 | 23 | - Combinations
|
20 | 24 | - Inclusion-exclusion
|
21 | 25 |
|
22 |
| -## Conditional probability |
| 26 | +### Conditional probability |
23 | 27 | - Bayes rule
|
24 | 28 | - Law of total probability
|
25 | 29 |
|
26 |
| -## Probability Distributions |
| 30 | +### Probability Distributions |
27 | 31 | - Expectation and variance equations
|
28 |
| -- Discrete probability |
| 32 | +- Discrete probability and stories |
29 | 33 | - Continuous probability: uniform, gaussian, poisson
|
30 | 34 |
|
31 |
| -## Expectations, variance, and covariance |
| 35 | +### Expectations, variance, and covariance |
32 | 36 | - linearity of expectation
|
33 | 37 | - law of total expectation
|
34 | 38 | - covariance and correlation
|
35 | 39 | - independence implies zero correlation
|
36 | 40 | - hash collision probability
|
37 | 41 |
|
38 |
| -## Universality of Uniform distribution |
| 42 | +### Universality of Uniform distribution |
39 | 43 | - proof
|
40 | 44 | - circle problem
|
41 | 45 |
|
42 |
| -## Order statistics |
| 46 | +### Order statistics |
43 | 47 | - expectation of min and max and random variable
|
44 | 48 |
|
45 |
| -## Graph-based solutions involving multiple random variables |
| 49 | +### Graph-based solutions involving multiple random variables |
46 | 50 | breaking stick
|
47 | 51 | meeting at the train station
|
48 | 52 | simplex
|
49 | 53 | frog jump
|
50 | 54 |
|
51 |
| -## Approximation trick1: Central limit theorem |
| 55 | +### Approximation trick1: Central limit theorem |
52 | 56 | - fake coin
|
53 | 57 | - monte carlo integration
|
54 | 58 |
|
55 |
| -## Approximation trick2: Poisson paradigm |
| 59 | +### Approximation trick2: Poisson paradigm |
56 | 60 | - birthday problem, birthday triplets, near birthday problem
|
57 | 61 | - repeated draws
|
58 | 62 |
|
59 |
| -## Poisson count/time duality |
| 63 | +### Poisson count/time duality |
60 | 64 | - possion from possions
|
61 | 65 |
|
62 |
| -## Markov chain tricks |
| 66 | +### Markov chain tricks |
63 | 67 | - various games
|
64 | 68 | - introduction of martingale
|
| 69 | + |
| 70 | + |
| 71 | +## Statistics |
| 72 | + |
| 73 | + |
| 74 | +## Programming essentials |
| 75 | +The bare minimum of coding concept you need to know well. |
| 76 | + |
| 77 | +Material on these topics are widely available elsewhere, so we will just cite them here. |
| 78 | + |
| 79 | +Data structures: |
| 80 | +array, dict, link list, tree, heap, graph, ways of representing sparse matrix |
| 81 | + |
| 82 | +Sorting: brilliant.org |
| 83 | + |
| 84 | +Tree/Graph related algorithms |
| 85 | +traversal (BFS, DFS) |
| 86 | +shortest path (two sided BFS, djikstra) |
| 87 | + |
| 88 | +Recuision, iteration and DP: |
| 89 | + |
| 90 | +## Numerical methods and optimization |
| 91 | + |
| 92 | +## Machine learning concepts |
| 93 | + |
| 94 | + |
| 95 | + |
| 96 | +## Contribute |
| 97 | +If you wish to contribute to this writing, feel free to submit a PR. |
| 98 | + |
| 99 | +If you wish to contribute anonymously, please contact us at TBD |
0 commit comments