- Thinking Techniques as follows:
n | Complexity | Possible Algorithms & Techniques |
---|---|---|
1018+ | O(1) | Math |
1018 | O(logn) | Binary & Ternary Search / Matrix Power / Cycle Tricks / Big Simulation Steps / Values Reranking / Math |
1016 | O(n1/2) | Math |
108 | O(n) | Greedy / Ad-hoc / DP |
4×107 | O(nlogn) | Linear # Calls to Binary & Ternary Search / Pre-processing & Querying / Divide and Conquer |
104 | O(n2) | Ad-hoc / DP / Greedy / Divide and Conquer / Branch and Bound |
500 | O(n3) | Ad-hoc / DP / Greedy / Divide and Conquer / Branch and Bound |
90 | O(n4) | Ad-hoc / DP / Greedy / Divide and Conquer / Branch and Bound |
50 | O(n5) | Branch and Bound |
40 | O(n×2n/2) | Meet in the Middle |
20 | O(n×2n) | Backtracking / Generating 2n Subsets / Bitmask Technique |
11 | O(n!) | Factorial / Permutation / Combination Algorithm |
- Complexity
- Code Template
- Math
- Visualization
- Programming Languages
- C++
- Python
- JavaScript
- Golang
- Algorithms
- Introduction
- Competitive Programming
- Advanced Reference
- System Design
- Introduction
- Database
- Microservices
- Performance
- Open Source Applications
- Software Development
- Development
- Design Patterns
- Architecture Patterns
- Software Engineering
- Software Testing
- Site Reliability Engineering
- Technical Leadership
- Computer Science
- Computer Systems
- Computer Mathematics
- Computer Organization and Architecture
- Compiler
- Operating Systems
- Introduction
- Linux
- Windows
- Computer Networking
- Introduction
- Network Protocol
- Network Programming
- Competition Infoformation
- Annual Programming Competition
- Google Coding Competitions (discontinued)
- Meta Hacker Cup
- Weekly/Biweekly/Monthly Programming Competition
- For Competitive Programming
- AtCoder (more mathy)
- CodeForces
- Topcoder (more mathy)
- CodeChef
- For Interview
- For Competitive Programming
- Practice Sites
- For Competitive Programming
- For Interview
- Mathematical Programming Challenges
- Annual Programming Challenges
- Computer Science
- Golang Design