Description
Problems that can be solved by binary search. The data we search can be in an array, or it could be some range of solution spaces (even real values). The common connection is that the data are ordered, which allows efficient searching with binary search. Writing binary search can be tricky; try implementing different versions of binary search (even on the same problems) for practice.
Start & End Times
| Start Time | 2026-02-16 21:30 CET |
| End time | 2026-03-02 21:30 CET |
Problems
| Label | Problem |
|---|---|
| A | Massive Card Game |
| B | Firefly |
| C | Suspension Bridges |
Scoring
Pass/Fail — Unranked
Explanation:
Each problem is pass/fail. Participants are not ranked
Results
- Results are shown without limitation.