All challenges

Decide whether a hidden graph is bipartite using the original edge-count query protocol.

Decide graph connectivity through a hidden cut-neighborhood oracle.

Find the hidden chord in a cycle by querying shortest-path distances.