- š Hi, Iām @debacoding
- š Iām interested in coding,creative writing,etc
- š± Iām currently learning competitive prpgramming skills using c++
- šļø Iām looking to collaborate on any intetesting projects
- š« How to reach me at [email protected], [email protected]
- Geeks for Geeks Practice
- Competitive Programming
- CPP
- HTML
Practice |
Language |
Practice |
Language |
Practice |
Language |
HACKER RANK (HR) |
|
HACKER EARTH (HE) |
|
GEEKS FOR GEEKS (GFG) |
|
1. Practice / C++ |
CPP |
1. Start Online Programming |
CPP |
1. Arrays |
|
1.1. Introduction |
|
2. Basic Programming |
CPP |
2. Vector |
|
1.2. Strings |
|
2.1. Basics of I/O |
|
|
|
1.3. Classes |
|
2.2. Basics of Implementation |
|
|
|
1.4. Inheritance |
|
2.3. Basics of Operators |
|
|
|
1.5. Debugging |
|
2.4. Recursion and Backtracking |
|
|
|
1.6. Other concepts |
|
2.5. Basics of Bit Manipulation |
|
|
|
1.7. STL |
|
3. Data structures |
CPP |
|
|
2. Practice / Datastructures |
CPP |
3.1. Arrays |
|
|
|
3. Practice / Algorithms |
CPP |
3.2. Stacks |
|
|
|
4. 30 Days of Code |
CPP |
3.3. Queues |
|
|
|
5. Project Euler + |
CPP |
3.4. Hash tables |
|
|
|
6. Interview prep kit |
CPP |
3.5. Linked list |
|
|
|
7. Practice / SQL |
MySQL |
3.6. Trees |
|
|
|
8. Practice / Databases |
|
3.7. Advanced DS |
|
|
|
9. Practice / Java |
Java |
3.8. Disjoint DS |
|
|
|
9.1. Introduction |
|
4. Algorithms |
CPP |
|
|
9.2. Strings |
|
5. Maths |
CPP |
|
|
9.3. BigNumber |
|
|
|
|
|
9.4. Data Structures |
|
|
|
|
|
9.5. OOP |
|
|
|
|
|
9.6. Exception Handling |
|
|
|
|
|
9.7. Advanced |
|
|
|
|
|
10. Practice / C |
C |
|
|
|
|
10.1. Introduction |
|
|
|
|
|
10.2. Conditionals and Loops |
|
|
|
|
|
10.3. Arrays and Strings |
|
|
|
|
|
10.4. Functions |
|
|
|
|
|
10.5. Structs and Enums |
|
|
|
|
|
11. Practice / Python |
Python |
|
|
|
|
- Include this line in main() for fast I/O operations:
std::ios_base::sync_with_stdio(false);
- after sorting an array elements, first element becomes smallest and last becomes largest
- for rotation of an array by D elements :
if(D>N)
D %= N;
// For left rotate-
arr[i] = arr[(i+D)%N]
// For right rotate-
arr[i] = arr[(i+N-D)%N]