No matching problems.
Try a shorter search or fewer filters.
Try a shorter search or fewer filters.
Problems submitted by readers. These drafts have not been reviewed for inclusion in the catalogue or the benchmark.
Loading shared contributions…
The catalogue brings together questions across theoretical computer science, ordered within each category by votes, with catalogue priority breaking ties. It includes selected problems that were open on January 1, 2026 and resolved later. Some formulations and current statuses still need review; each card preserves its sources and known limitations.
Use Compact for a quick overview or Full for the complete statement and context. Use Add comment on a card to post a public comment without an account. Propose a problem through the New problem form on GitHub.
Vote with 👍 or 👎; click your selected thumb again to remove your vote. One vote per problem is remembered in this browser. Scores are shared with everyone and affect the order within each category. Votes and green/red selection are separate decisions.
The selection target is 500 green problems: 25 per large category and 10 per small category. Anyone can change colors directly on each card and use the offered up/down button to move a card between its two categories. Shared changes persist; counts may be above or below target. Green means selected for the dataset, regardless of whether the problem is open or resolved.
These vote-based views are separate from the green selection.