Project
CSES
A collection of algorithmic problems covering different algorithms and data structures
September 2026 — Present
algorithmsdata-structuresproblem-solving
CSES is a collection of algorithmic programming problems for practicing competitive programming and problem-solving.
The problems range from fundamental algorithms and data structures to more advanced topics such as graph algorithms, dynamic programming, number theory, string algorithms, geometry, and range queries.
I use CSES to practice algorithms, learn new techniques, and improve my ability to turn ideas into efficient implementations.
What the problems cover
| Topic | Examples |
|---|---|
| Introductory Problems | Simulation, combinatorics, basic algorithms |
| Sorting and Searching | Sorting, binary search, greedy algorithms, two pointers |
| Dynamic Programming | Optimization, counting, sequence and state-based DP |
| Graph Algorithms | DFS, BFS, shortest paths, connectivity, flows |
| Range Queries | Prefix sums, Fenwick trees, segment trees |
| Tree Algorithms | Tree traversal, ancestors, paths, subtrees |
| Mathematics | Number theory, combinatorics, modular arithmetic |
| String Algorithms | Pattern matching, palindromes, substring algorithms |
| Geometry | Points, lines, intersections, distances |
| Advanced Techniques | More specialized algorithms and data structures |
My progress
| Tasks solved | Completion | Rank | Submissions | Primary language | Country |
|---|---|---|---|---|---|
| 124 / 400 | 31% | 5,151 / 323,988 | 187 | Python 3 | India |
Languages
| Language | Submissions | Share |
|---|---|---|
| Python 3 | 173 | 92.51% |
| Rust | 9 | 4.81% |
| Ruby | 4 | 2.14% |
| Java | 1 | 0.53% |
First submission: 30 May 2026
Last submission: 11 June 2026
Solutions
I keep my CSES solutions in a public GitHub repository.