Bester Primer Contest 5
Duration
1h 0m
Problems
5
Total difficulty
6600
Participants
0
Sign in to start a virtual contest.
| # | Name | Tags | Difficulty | |
|---|---|---|---|---|
| ✓ | A | Python negative indexing mylist[-1] An Interview Primer for Quantitative Finance (Dirk Bester, 2017) · Ch 1 · Interviews | pythonindexing | |
| ✓ | B | Derivative of inverse function An Interview Primer for Quantitative Finance (Dirk Bester, 2017) · Ch 1 · Interviews | calculusinverse-function | |
| ✓ | C | n bandits — favorite sorting algorithm An Interview Primer for Quantitative Finance (Dirk Bester, 2017) · Ch 1 · Interviews | algorithmsortingcomplexity | |
| ✓ | D | Random walk hit l before 0 An Interview Primer for Quantitative Finance (Dirk Bester, 2017) · Ch 1 · Interviews | random-walkgamblers-ruinmartingale | |
| ✓ | E | Two cards from 52-20 deck both aces An Interview Primer for Quantitative Finance (Dirk Bester, 2017) · Ch 1 · Interviews | probabilitysymmetrycards |