For Questions please refer : Questions
This is the repository to hold my solutions for Facebook Hacker Cup 2020 Qualification Round, questions can be refered from the link given above, I secured 2664/ 32699 Rank. It was my first faceBook competition and I learned a lot.
Asymptotic Analysis :
| Question Name | Time Complexity (Worst) | Time Complexity (Worst) | Space Complexity |
|---|---|---|---|
| Travel Restriction | O (n^2) | O (n) | O(n) |
| Alchemy | O (n) | O (n) | O (n) |
| Timber | O ( 2 ^ n ) | O ( 2 ^ n ) | O (n) |
| Running on Fumes | O ( n * log(m) | O (1) | O (n) |
Correct me if my analysis is wrong, or my code can be improved. Please ping me at : choubeymritunjay3@gmail.com