FacebookHackerCup-2012 [](https://creativecommons.org/licenses/by-nc/3.0/)
February 11, 2020 ยท View on GitHub
Python solutions of Facebook Hacker Cup 2012. Solution begins with * means it will get TLE in the largest data set (total computation amount > 10^8, which is not friendly for Python to solve in 5 ~ 15 seconds). A 6-minute timer is set for uploading the result this year.
Qualification Round
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 1 | Alphabet Soup | ||||||
| 2 | Auction | ||||||
| 3 | Billboards |
Round 1
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 1 | Checkpoint | ||||||
| 2 | Recover the Sequence | ||||||
| 3 | Squished Status |
Round 2
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 1 | Monopoly | ||||||
| 2 | Road Removal | ||||||
| 3 | Sequence Slicing |
Round 3
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 1 | Divisor Function Optimization | ||||||
| 2 | Trapezoids | ||||||
| 3 | Unfriending |
Final Round
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 1 | Linsane Phone Numbers | ||||||
| 2 | Maximal Multiplicative Order | ||||||
| 3 | Possible Medians | Very Hard |