⚡ Build the skills to land top-paying quant jobs. Offer ends in --d --h --m --s-- days -- hours -- minutes -- seconds.
⚡ Build the skills to land top-paying quant jobs. Offer ends in 18d 12h 54m 45s18 days 12 hours 54 minutes 45 seconds.
PuzzledQuant has 16 problems tagged IMC: 4 easy, 10 medium and 2 hard. The most common topics among them are Probability, C++ and Expected Value. 9 are free to solve, and the other 7 are part of Premium.
| # | Title | Difficulty |
|---|---|---|
| 1 | Coin toss game | Medium |
| 2 | Random ants | Medium |
| 3 | Roll Die till Sequence | Medium |
| 4 | Robot Long Jump II | Hard |
| 5 | Minesweeping II(Premium) | Medium |
| 6 | Product of Face Counts in Ten Die Rolls | Medium |
| 7 | Ten Dice and Divisibility by Seven | Medium |
| 8 | Robot Tug-of-War I: Robot Cart Relay(Premium) | Easy |
| 9 | Thread-local initialization count(Premium) | Medium |
| 10 | Robot Archery II(Premium) | Hard |
| 11 | Professor Rando II | Medium |
| 12 | Integer division edge case(Premium) | Easy |
| 13 | Compile-time self-referencing templates(Premium) | Easy |
| 14 | Is long always larger than int?(Premium) | Medium |
| 15 | Color Complex | Medium |
| 16 | Typical sizeof(std::shared_ptr) on 64-bit | Easy |
To track your progress or combine this with other filters, open the full problem list. Problems marked with a lock are part of Premium.