Problem Categories
- Codeforces
- UT Austin ACM
- HackerRank
- Google CodeJam
- USACO
- UVa Online Judge
- LeetCode
- TopCoder
Languages
- Java
- C++
- Python 2/3
| Complexity | Maximum Input Size | Comments |
|---|---|---|
| O(N) | 100,000,000 (10^8) | |
| O(N Log N) | 100,000 (10^5) | Merge Sort/Building Segment Tree |
| O(N^2) | 10,000 | Bubble/Selection/Insertion Sort |
| O(N^3) | 300 | Floyd Warshall |
| O(N^4) | 100 | DP with 3 dimensions + O(n) loop |
| O(2^N) | 20 | DP/Bitmask Technique |
| O(2^N N^2) | 13 | DP Travelling Salesman Problem |
| O(N!), O(N^6) | 10 | Enumerating a Permutation |