All challenges

Compute the probability that a random DNA string matches at least one wildcard pattern.

Estimate divisor counts for hidden integers through the original GCD query protocol.

Recover the hidden DiverC dictionary through the original autofill query service.

Choose a subset whose unordered pairwise XOR values are all distinct.

Count distinct bakery cake types in the source instance.

Recover a hidden circular disk by probing line-segment intersection lengths.

Find an adaptively hidden absent student despite bounded dishonest replies.

Print an 8 by 14 digit grid that can read a long prefix of positive integers by adjacent walks.

Identify all demagnetized magnets from the source instances.

Select delivery requests and a route that completes them with low travel time.

Permute names to reduce substring complaint costs over adjacent pairs.

Optimize a Triton decoding-attention kernel for decoder-style attention shapes.