CSES Problem Set
The CSES (Competitive Programmer's Handbook) Problem Set is a comprehensive collection of algorithmic problems designed to help programmers master fundamental computer science concepts. This problem set covers a wide range of topics including sorting, searching, dynamic programming, graph algorithms, range queries, and more.
This section contains my C++ solutions to CSES problems. Each solution includes the complete implementation with the key algorithmic approach. The problems are organized by topic, making it easy to find solutions related to specific algorithmic techniques or data structures.
All solutions are available on GitHub.
Apartments
Solution implementation
Building Roads
Solution implementation
Building Teams
Solution implementation
Collecting Numbers
Solution implementation
Concert Tickets
Solution implementation
Counting Rooms
Solution implementation
Course Schedule
Solution implementation
Dice Combinations
Solution implementation
Distinct Numbers
Solution implementation
Dynamic Range Minimum Queries
Solution implementation
Dynamic Range Sum Queries
Solution implementation
Edit Distance
Solution implementation
Ferris Wheel
Solution implementation
Flight Discount
Solution implementation
Flight Routes
Solution implementation
Game Routes
Solution implementation
High Score
Solution implementation
Longest Flight Route
Solution implementation
Maximum Subarray Sum
Solution implementation
Message Route
Solution implementation
Minimizing Coins
Solution implementation
Missing Coin Sum
Solution implementation
Monsters
Solution implementation
Movie Festival
Solution implementation
Restaurant Customers
Solution implementation
Round Trip
Solution implementation
Shortest Routes I
Solution implementation
Shortest Routes II
Solution implementation
Static Range Minimum Queries
Solution implementation
Static Range Sum Queries
Solution implementation
Stick Lengths
Solution implementation
Sum Of Two Values
Solution implementation
Weird Algorithm
Simple simulation following the algorithm rules