Solutions to competitive programming problems from the Codebreaker Informatics Olympiad Trainer
Codebreaker is an Informatics Olympiad training platform developed at the National University of Singapore. It provides a curated set of competitive programming problems aimed at developing algorithmic problem-solving skills for competitions such as the Singapore National Olympiad in Informatics (NOI) and the International Olympiad in Informatics (IOI).
| Area | Topics |
|---|---|
| Data Structures | Arrays, prefix sums, adjacency lists and matrices, stacks, trees |
| Graph Algorithms | BFS, DFS, shortest paths, spanning trees |
| Dynamic Programming | Classical DP patterns, 2D prefix sums, interval DP |
| Mathematics | Combinatorics, number theory, modular arithmetic |
| Greedy & Sorting | Greedy strategies, custom comparators, sorting-based solutions |
| String Algorithms | Pattern matching, bracket validation |
codebreaker-solutions/
└── solutions/
├── problem-name.cpp
└── ...
Each .cpp file corresponds to a single problem and contains a self-contained solution.
All solutions are published for educational purposes. Problems should be attempted independently before consulting any solution — the problem-solving process itself is where the learning happens.
This repository is licensed under the MIT License.