12 statement texts and 12 PDFs are available for this year.
- A. A-Skew-ed Reasoning
- B. Blackboard Game
- C. Bride of Pipe Stream
- D. Buggy Rover
This section has six public branches: the ICPC archive, the IOI archive, the LeetCode archive, the CSES archive, the Codeforces 3500+ archive, and a growing Data Structures & Algorithms notebook. The contest pages keep explanations and code tied to source files; the LeetCode branch emphasizes interview-facing pattern recognition; the DSA branch keeps reusable ideas in longer note form.
The contest archives browse by track/year or official category, while the DSA branch acts as a reusable knowledge base.
212 problems across 18 years. 212 statement texts and 212 PDFs are mirrored in the archive.
Browse ICPC 02 IOI177 problems across 36 years. Each task page centers the write-up and code.
Browse IOI 03 LeetCode8 curated interview-focused solutions across 8 active categories, with pattern recognition, original summaries, and clean C++ implementations.
Browse LeetCode 04 DSA85 published notes across 9 categories, all kept in TeX plus standalone C++ so the write-up and implementation stay editable.
Browse DSA notes 05 CSES15 published solutions across 11 official categories, with original summaries, rendered editorials, and exact C++ source files.
Browse CSES 06 CODEFORCES2 published deep dives for very hard Codeforces problems, each kept intentionally small-batch and source-first.
Browse Codeforces 3500+The year page is the main browsing layer: it lists the problems, resource badges, and direct links to each solution page.
12 statement texts and 12 PDFs are available for this year.
12 statement texts and 12 PDFs are available for this year.
Task pages are grouped here by year before you drill down into an individual problem.
11 statement texts and 11 PDFs are available for this year.
Task pages are grouped here by year before you drill down into an individual problem.
11 statement texts and 11 PDFs are available for this year.
These stay secondary to the track/year browse flow, but they are still useful when you want to see what changed most recently.
Return every distinct triplet whose values sum to zero without duplicating answers.
Track the longest contiguous substring whose characters stay unique.
For each day, compute how far away the next warmer temperature appears.
Count how many connected land components appear in a binary grid.
Find the lowest node in a binary tree whose subtree contains both target nodes.
Given a rooted tree with N nodes, each with weight W[i]. Assign integer ``coefficients'' C[i] to each node such that for every node i, the sum of coefficients in its subtree is between L and R (given per query). Minim...