This repository contains structured Competitive Programming notes, optimized C++ implementations, and curated problem-solving resources.
It is designed for:
- Systematic learning
- Fast revision before contests
- Strengthening algorithmic intuition
- Interview preparation
- Building long-term competitive programming consistency
The repository focuses on writing clean, efficient, and reusable implementations following competitive programming standards and constraints.
A curated collection of beginner-friendly Codeforces problems focused on:
- implementation
- observation
- brute force thinking
- basic data structures
- problem-solving fundamentals
Problems focused on:
- pattern recognition
- greedy thinking
- constructive approaches
- simulation
- beginner-intermediate contest strategies
Topics covered:
- Prime numbers
- Sieve algorithms
- GCD and divisors
- Modular arithmetic
- Prime factorization
- Competitive programming problem variants
Topics covered:
- BFS and DFS traversal
- Grid-based graph problems
- Shortest path basics
- Graph representation
- CSES graph problems
- Dynamic Programming
- Bit Manipulation
- Arrays and Strings
- Binary Search
- Recursion and Backtracking
- Greedy Algorithms
- Trees and Binary Trees
- Segment Trees
- Disjoint Set Union (DSU)
- Codeforces
- CSES
- LeetCode
- AtCoder (planned)
| Category | Technology |
|---|---|
| Programming Language | C++ |
| Paradigm | Competitive Programming |
| Focus | Optimized and reusable implementations |
| STL Usage | Extensive |
| Goal | Contest-ready solutions |
CP-Notes/
│
├── CP-31 800 sheet/
├── CP-31 900 sheet/
│
├── Graphs/
│ └── CSES Problems/
│
├── Greedy/
├── Number-Theory/
│
├── .gitignore
├── CODE_OF_CONDUCT
├── CP-Topics.md
├── CSES Handbook.pdf
├── README.md
└── googlee480616b4aa2c4f1.html
- Build strong algorithmic and problem-solving fundamentals
- Maintain structured topic-wise CP notes
- Improve contest speed, accuracy, and consistency
- Create a long-term revision resource
- Strengthen interview preparation through problem solving
- One problem per file
- Optimized time and space complexity
- Readable and reusable code
- Consistent naming conventions
- STL-focused implementations
- Contest-oriented approach
This repository can be used for:
- Topic-wise revision before contests
- Learning standard CP algorithms
- Reference implementations
- Interview preparation
- Daily problem-solving practice
- Tracking long-term CP progress
This repository is maintained primarily for personal learning and practice.
Suggestions, improvements, optimizations, and cleaner approaches are always welcome.
- Competitive Programming Resources
- CSES Problem Set Handbook
- Codeforces Problem Sets
- Standard CP Editorials
If this repository helps your learning journey, consider giving it a ⭐ on GitHub.