Once you enter in programming you just don’t learn how to code but you also learn the “art of thinking”, by breaking your code into smaller chunks and then using your logic-based creativity to solve a problem from different angles.
- Publicly Demonstrate Your Skills. You are making your profile by participating in different platforms like CodeChef, Codeforces etc.
- Prepare You well for Technical Interviews.
- Makes your desirable candidate for Major Companies.
- Makes you Faster and Focused.
- Helps you solve Complicated Problems.
- Guarenteed Brain Exercise. Always keeps you motivated.
| N | Time Complexity |
|---|---|
| 10^18 | O(logN) |
| 10^8 | O(N) |
| 10^4 | O(N^2) |
| 10^7 | O(logN) |
| 5*10^2 | O(N^3) |
| 0<=N<=9*10 | O(N^4) |
| 0<=N<=20 | O(2^n) |
| 0<=N<=11 | O(N!) |
- Accepted
- TLE (Time Limit Exceeded)
- Compilation Error
- Runtime Error:
- Dividing by Zero.
- Segmentation Fault:
- Indices is out of bound i.e. maybe negative or greater than size of array.
- Array size is greater than 10^8.
- Max memory for function - 4MB.
- Array size can be of atmost 10^6. It will be created in stack memory.
- Un-initialized variables.
- int : we should check the limit and assign the result proper data type. if result can be greater than 10^8 , we should use long long
- float : we might need to use double as per the constraints.
- Pre-Requisite
- Pointers
- Dynamic Allocation
- Recursion
- Complexity And Language Tools
- Searching & Sorting
- Advance Recursion
- Backtracking
- Bit Manipulation
- Adhoc Problems
- Modulo Arithmetic
- Dynamic Programming, Dynamic Programming 2
- Greedy Problems
- Segment Trees
- Graphs 1, Graphs 2, Advance Graphs
- String Algorithms
- Tries
- Fenwick Tree
- DP and Bitmasking
- Number Theory 1, Applications Of NT - 1
- Number Theory 2
- Number Theory 3
- Game Theory
- Computational Geometry
- FFT