Reference

Handy Table

n	Complexity	Possible Algorithms & Techniques
10¹⁸+	O(1)	Math
10¹⁸	O(logn)	Binary & Ternary Search / Matrix Power / Cycle Tricks / Big Simulation Steps / Values Reranking / Math
10¹⁶	O(n^1/2)	Math
10⁸	O(n)	Greedy / Ad-hoc / DP
4×10⁷	O(nlogn)	Linear # Calls to Binary & Ternary Search / Pre-processing & Querying / Divide and Conquer
10⁴	O(n²)	Ad-hoc / DP / Greedy / Divide and Conquer / Branch and Bound
500	O(n³)	Ad-hoc / DP / Greedy / Divide and Conquer / Branch and Bound
90	O(n⁴)	Ad-hoc / DP / Greedy / Divide and Conquer / Branch and Bound
50	O(n⁵)	Branch and Bound
40	O(n×2^n/2)	Meet in the Middle
20	O(n×2ⁿ)	Backtracking / Generating 2ⁿ Subsets / Bitmask Technique
11	O(n!)	Factorial / Permutation / Combination Algorithm

Programming Languages
- C++
  - Introduction
  - Advanced
    - Inside the C++ Object Model
    - Modern C++ Design
- Python
  - Effective Python
  - Python in Practice
- JavaScript
- Golang
Algorithms
- Introduction
- Competitive Programming
- Advanced Reference
  - The Art of Computer Programming
System Design
- Introduction
- Database
- Microservices
  - Microservices Patterns
- Performance
  - Systems Performance
- Open Source Applications
  - The Architecture of Open Source Applications
Software Development
- Introduction
- Design Patterns
Computer Science
- Computer Systems
  - Computer Systems
- Computer Mathematics
  - Introduction to Linear Algebra
  - Concrete Mathematics
- Computer Organization and Architecture
  - Computer Organization and Design
  - Computer Architecture
- Compiler
  - Compilers
  - Crafting Interpreters
- Operating Systems
- Computer Networking
  - Introduction
    - Computer Networking
  - Network Protocol
    - TCP/IP Illustrated, Volume 1
  - Network Programming