All challenges

Recover the hidden permutation used by pairwise bitwise-or queries.

Reconstruct hidden weighted trees through the original Frontier-CS distance-query interaction.

Explore a uniform directed cave by marking passages until the treasure appears.

Find the unique centroid of a hidden tree through distance queries.

Find the two anomaly nodes in each tree source case.

Navigate hidden neighbor orders to visit every graph vertex efficiently.

Reconstruct a hidden tree using Steiner-membership queries.

Identify hidden key and treasure stars through directed reachability questions.

Recover the sorted array from mode-query source data.

Compute the requested smallest snake coverage values.

Recover hidden node signs in a rooted tree using path-sum and toggle queries.

Navigate an infinite colored tree to the exit through the original interactive distance device.